java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:33,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:33,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:33,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:33,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:33,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:33,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:33,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:33,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:34,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:34,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:34,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:34,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:34,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:34,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:34,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:34,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:34,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:34,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:34,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:34,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:34,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:34,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:34,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:34,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:34,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:34,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:34,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:34,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:34,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:34,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:34,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:34,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:34,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:34,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:34,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:34,051 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 11:58:34,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:34,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:34,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:34,074 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:34,075 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:34,075 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:34,075 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:34,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:34,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:34,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:34,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:34,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:34,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:34,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:34,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:34,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:34,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:34,078 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:34,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:34,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:34,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:34,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:34,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:34,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:34,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:34,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:34,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:34,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:34,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:34,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:34,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:34,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:34,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:34,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:34,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:34,145 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:34,145 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-23 11:58:34,215 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627905853/de3174172f64471e8e7e8da3fca65674/FLAG29bcf0f48 [2018-11-23 11:58:34,693 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:34,693 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-23 11:58:34,701 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627905853/de3174172f64471e8e7e8da3fca65674/FLAG29bcf0f48 [2018-11-23 11:58:35,007 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627905853/de3174172f64471e8e7e8da3fca65674 [2018-11-23 11:58:35,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:35,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:35,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:35,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:35,023 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:35,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35, skipping insertion in model container [2018-11-23 11:58:35,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:35,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:35,264 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:35,269 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:35,295 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:35,318 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:35,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35 WrapperNode [2018-11-23 11:58:35,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:35,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:35,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:35,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:35,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:35,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:35,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:35,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:35,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (1/1) ... [2018-11-23 11:58:35,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:35,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:35,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:35,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:35,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (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 11:58:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:35,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:35,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:35,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:35,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:36,112 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:36,113 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:58:36,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:36 BoogieIcfgContainer [2018-11-23 11:58:36,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:36,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:36,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:36,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:36,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:35" (1/3) ... [2018-11-23 11:58:36,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548407a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:36, skipping insertion in model container [2018-11-23 11:58:36,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:35" (2/3) ... [2018-11-23 11:58:36,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548407a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:36, skipping insertion in model container [2018-11-23 11:58:36,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:36" (3/3) ... [2018-11-23 11:58:36,126 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compareModified_true-unreach-call_ground.i [2018-11-23 11:58:36,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:36,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:36,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:36,187 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:36,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:36,188 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:36,188 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:36,188 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:36,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:36,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:36,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:36,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 11:58:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:36,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:36,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:36,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:36,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1032092789, now seen corresponding path program 1 times [2018-11-23 11:58:36,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:36,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:36,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 11:58:36,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 11:58:36,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 11:58:36,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #77#return; {34#true} is VALID [2018-11-23 11:58:36,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret9 := main(); {34#true} is VALID [2018-11-23 11:58:36,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {34#true} is VALID [2018-11-23 11:58:36,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 11:58:36,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} havoc ~x~0; {35#false} is VALID [2018-11-23 11:58:36,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume 0 != ~rv~0;~x~0 := 0; {35#false} is VALID [2018-11-23 11:58:36,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {35#false} is VALID [2018-11-23 11:58:36,394 INFO L256 TraceCheckUtils]: 10: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {35#false} is VALID [2018-11-23 11:58:36,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-23 11:58:36,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2018-11-23 11:58:36,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 11:58:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:36,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:36,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:36,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:58:36,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:36,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:36,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:36,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:36,579 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 11:58:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:36,902 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2018-11-23 11:58:36,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:36,903 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:58:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 11:58:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 11:58:36,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-23 11:58:37,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:37,190 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:58:37,190 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:58:37,194 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 11:58:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:58:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:58:37,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:37,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:58:37,241 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:58:37,242 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:58:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,247 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:58:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 11:58:37,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:37,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:37,249 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:58:37,249 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:58:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,254 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:58:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 11:58:37,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:37,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:37,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:37,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:58:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 11:58:37,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 14 [2018-11-23 11:58:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:37,261 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 11:58:37,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 11:58:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:37,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:37,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:37,263 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:37,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash -958951712, now seen corresponding path program 1 times [2018-11-23 11:58:37,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:37,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:37,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2018-11-23 11:58:37,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {194#true} is VALID [2018-11-23 11:58:37,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-23 11:58:37,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #77#return; {194#true} is VALID [2018-11-23 11:58:37,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret9 := main(); {194#true} is VALID [2018-11-23 11:58:37,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {196#(= main_~i~0 0)} is VALID [2018-11-23 11:58:37,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {196#(= main_~i~0 0)} assume !(~i~0 < 100000); {195#false} is VALID [2018-11-23 11:58:37,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {195#false} havoc ~x~0; {195#false} is VALID [2018-11-23 11:58:37,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {195#false} assume 0 != ~rv~0;~x~0 := 0; {195#false} is VALID [2018-11-23 11:58:37,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {195#false} is VALID [2018-11-23 11:58:37,358 INFO L256 TraceCheckUtils]: 10: Hoare triple {195#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {195#false} is VALID [2018-11-23 11:58:37,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {195#false} ~cond := #in~cond; {195#false} is VALID [2018-11-23 11:58:37,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {195#false} assume 0 == ~cond; {195#false} is VALID [2018-11-23 11:58:37,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2018-11-23 11:58:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:37,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:37,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:37,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:58:37,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:37,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:37,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:37,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:37,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:37,399 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2018-11-23 11:58:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,589 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 11:58:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:37,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:58:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 11:58:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 11:58:37,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 11:58:37,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:37,982 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:58:37,982 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:58:37,983 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 11:58:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:58:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 11:58:37,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:37,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:38,000 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:38,000 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,005 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 11:58:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 11:58:38,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,006 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 11:58:38,006 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 11:58:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,009 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 11:58:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 11:58:38,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:38,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:58:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 11:58:38,014 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 14 [2018-11-23 11:58:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:38,014 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 11:58:38,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:58:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:58:38,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:38,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:38,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:38,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1796820510, now seen corresponding path program 1 times [2018-11-23 11:58:38,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 11:58:38,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {357#true} is VALID [2018-11-23 11:58:38,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 11:58:38,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #77#return; {357#true} is VALID [2018-11-23 11:58:38,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret9 := main(); {357#true} is VALID [2018-11-23 11:58:38,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {357#true} is VALID [2018-11-23 11:58:38,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {357#true} is VALID [2018-11-23 11:58:38,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#true} assume #t~mem0 != #t~mem1;havoc #t~mem1;havoc #t~mem0;~rv~0 := 0; {359#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:38,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {359#(= main_~rv~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {359#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:38,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {359#(= main_~rv~0 0)} assume !(~i~0 < 100000); {359#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:38,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(= main_~rv~0 0)} havoc ~x~0; {359#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:38,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {359#(= main_~rv~0 0)} assume 0 != ~rv~0;~x~0 := 0; {358#false} is VALID [2018-11-23 11:58:38,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {358#false} is VALID [2018-11-23 11:58:38,130 INFO L256 TraceCheckUtils]: 13: Hoare triple {358#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {358#false} is VALID [2018-11-23 11:58:38,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 11:58:38,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 11:58:38,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 11:58:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:38,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:38,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:38,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:58:38,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:38,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:38,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:38,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:38,240 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2018-11-23 11:58:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,427 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 11:58:38,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:38,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:58:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 11:58:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 11:58:38,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 11:58:38,574 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 11:58:38,577 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:58:38,577 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:58:38,578 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 11:58:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:58:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-23 11:58:38,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:38,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2018-11-23 11:58:38,604 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2018-11-23 11:58:38,604 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2018-11-23 11:58:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,607 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 11:58:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 11:58:38,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,609 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2018-11-23 11:58:38,609 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2018-11-23 11:58:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:38,619 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 11:58:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 11:58:38,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:38,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:38,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:38,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:58:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 11:58:38,629 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 17 [2018-11-23 11:58:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:38,630 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 11:58:38,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 11:58:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:58:38,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:38,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:38,631 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:38,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2105119776, now seen corresponding path program 1 times [2018-11-23 11:58:38,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:38,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:38,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:38,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2018-11-23 11:58:38,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {551#true} is VALID [2018-11-23 11:58:38,746 INFO L273 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2018-11-23 11:58:38,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #77#return; {551#true} is VALID [2018-11-23 11:58:38,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2018-11-23 11:58:38,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {553#(= main_~i~0 0)} is VALID [2018-11-23 11:58:38,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {553#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {553#(= main_~i~0 0)} is VALID [2018-11-23 11:58:38,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {553#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {553#(= main_~i~0 0)} is VALID [2018-11-23 11:58:38,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {553#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {554#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:38,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {554#(<= main_~i~0 1)} assume !(~i~0 < 100000); {552#false} is VALID [2018-11-23 11:58:38,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {552#false} havoc ~x~0; {552#false} is VALID [2018-11-23 11:58:38,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {552#false} assume 0 != ~rv~0;~x~0 := 0; {552#false} is VALID [2018-11-23 11:58:38,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {552#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {552#false} is VALID [2018-11-23 11:58:38,763 INFO L256 TraceCheckUtils]: 13: Hoare triple {552#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {552#false} is VALID [2018-11-23 11:58:38,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {552#false} ~cond := #in~cond; {552#false} is VALID [2018-11-23 11:58:38,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {552#false} assume 0 == ~cond; {552#false} is VALID [2018-11-23 11:58:38,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {552#false} assume !false; {552#false} is VALID [2018-11-23 11:58:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:38,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:38,766 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 11:58:38,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:39,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2018-11-23 11:58:39,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {551#true} is VALID [2018-11-23 11:58:39,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2018-11-23 11:58:39,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #77#return; {551#true} is VALID [2018-11-23 11:58:39,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2018-11-23 11:58:39,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {551#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {573#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:39,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {573#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:39,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {573#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {573#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:39,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {554#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:39,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {554#(<= main_~i~0 1)} assume !(~i~0 < 100000); {552#false} is VALID [2018-11-23 11:58:39,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {552#false} havoc ~x~0; {552#false} is VALID [2018-11-23 11:58:39,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {552#false} assume 0 != ~rv~0;~x~0 := 0; {552#false} is VALID [2018-11-23 11:58:39,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {552#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {552#false} is VALID [2018-11-23 11:58:39,450 INFO L256 TraceCheckUtils]: 13: Hoare triple {552#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {552#false} is VALID [2018-11-23 11:58:39,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {552#false} ~cond := #in~cond; {552#false} is VALID [2018-11-23 11:58:39,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {552#false} assume 0 == ~cond; {552#false} is VALID [2018-11-23 11:58:39,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {552#false} assume !false; {552#false} is VALID [2018-11-23 11:58:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:39,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:39,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:58:39,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:58:39,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:39,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:39,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:39,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:39,591 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 5 states. [2018-11-23 11:58:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,802 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 11:58:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:39,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:58:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:58:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:58:39,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 11:58:39,909 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 11:58:39,911 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:58:39,911 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:58:39,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:58:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-23 11:58:39,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:39,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 37 states. [2018-11-23 11:58:39,933 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 37 states. [2018-11-23 11:58:39,933 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 37 states. [2018-11-23 11:58:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,937 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 11:58:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 11:58:39,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:39,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:39,938 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 41 states. [2018-11-23 11:58:39,938 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 41 states. [2018-11-23 11:58:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,941 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 11:58:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 11:58:39,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:39,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:39,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:39,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:58:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 11:58:39,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2018-11-23 11:58:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:39,945 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 11:58:39,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 11:58:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:58:39,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:39,947 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:39,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:39,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1376090400, now seen corresponding path program 2 times [2018-11-23 11:58:39,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:39,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {818#true} call ULTIMATE.init(); {818#true} is VALID [2018-11-23 11:58:40,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {818#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {818#true} is VALID [2018-11-23 11:58:40,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {818#true} assume true; {818#true} is VALID [2018-11-23 11:58:40,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {818#true} {818#true} #77#return; {818#true} is VALID [2018-11-23 11:58:40,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {818#true} call #t~ret9 := main(); {818#true} is VALID [2018-11-23 11:58:40,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {818#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {820#(= main_~i~0 0)} is VALID [2018-11-23 11:58:40,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {820#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {820#(= main_~i~0 0)} is VALID [2018-11-23 11:58:40,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {820#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {820#(= main_~i~0 0)} is VALID [2018-11-23 11:58:40,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {820#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {821#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {821#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {821#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {822#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {822#(<= main_~i~0 2)} assume !(~i~0 < 100000); {819#false} is VALID [2018-11-23 11:58:40,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {819#false} havoc ~x~0; {819#false} is VALID [2018-11-23 11:58:40,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {819#false} assume 0 != ~rv~0;~x~0 := 0; {819#false} is VALID [2018-11-23 11:58:40,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {819#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {819#false} is VALID [2018-11-23 11:58:40,108 INFO L256 TraceCheckUtils]: 16: Hoare triple {819#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {819#false} is VALID [2018-11-23 11:58:40,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {819#false} ~cond := #in~cond; {819#false} is VALID [2018-11-23 11:58:40,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {819#false} assume 0 == ~cond; {819#false} is VALID [2018-11-23 11:58:40,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {819#false} assume !false; {819#false} is VALID [2018-11-23 11:58:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:40,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:40,110 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 11:58:40,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:40,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:40,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:40,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {818#true} call ULTIMATE.init(); {818#true} is VALID [2018-11-23 11:58:40,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {818#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {818#true} is VALID [2018-11-23 11:58:40,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {818#true} assume true; {818#true} is VALID [2018-11-23 11:58:40,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {818#true} {818#true} #77#return; {818#true} is VALID [2018-11-23 11:58:40,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {818#true} call #t~ret9 := main(); {818#true} is VALID [2018-11-23 11:58:40,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {818#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {841#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:40,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {841#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {841#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:40,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {841#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {841#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:40,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {841#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {821#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {821#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {821#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {822#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {822#(<= main_~i~0 2)} assume !(~i~0 < 100000); {819#false} is VALID [2018-11-23 11:58:40,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {819#false} havoc ~x~0; {819#false} is VALID [2018-11-23 11:58:40,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {819#false} assume 0 != ~rv~0;~x~0 := 0; {819#false} is VALID [2018-11-23 11:58:40,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {819#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {819#false} is VALID [2018-11-23 11:58:40,289 INFO L256 TraceCheckUtils]: 16: Hoare triple {819#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {819#false} is VALID [2018-11-23 11:58:40,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {819#false} ~cond := #in~cond; {819#false} is VALID [2018-11-23 11:58:40,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {819#false} assume 0 == ~cond; {819#false} is VALID [2018-11-23 11:58:40,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {819#false} assume !false; {819#false} is VALID [2018-11-23 11:58:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:40,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:40,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:58:40,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:58:40,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:40,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:58:40,376 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 11:58:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:58:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:58:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:40,377 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 6 states. [2018-11-23 11:58:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,588 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2018-11-23 11:58:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:40,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:58:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:58:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:58:40,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 11:58:40,698 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 11:58:40,700 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:58:40,700 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:58:40,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:58:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 11:58:40,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:40,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 11:58:40,734 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 11:58:40,735 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 11:58:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,738 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 11:58:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 11:58:40,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:40,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:40,739 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 11:58:40,739 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 11:58:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,742 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 11:58:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 11:58:40,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:40,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:40,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:40,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:58:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-23 11:58:40,746 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 20 [2018-11-23 11:58:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:40,746 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 11:58:40,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:58:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:58:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:58:40,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:40,747 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:40,748 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 466852896, now seen corresponding path program 3 times [2018-11-23 11:58:40,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:40,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:40,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-23 11:58:40,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1123#true} is VALID [2018-11-23 11:58:40,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-23 11:58:40,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #77#return; {1123#true} is VALID [2018-11-23 11:58:40,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret9 := main(); {1123#true} is VALID [2018-11-23 11:58:40,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {1125#(= main_~i~0 0)} is VALID [2018-11-23 11:58:40,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {1125#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1125#(= main_~i~0 0)} is VALID [2018-11-23 11:58:40,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {1125#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1125#(= main_~i~0 0)} is VALID [2018-11-23 11:58:40,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {1125#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1126#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {1126#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1126#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {1126#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1126#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:40,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {1126#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1127#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {1127#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1127#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {1127#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1127#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {1127#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1128#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {1128#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1124#false} is VALID [2018-11-23 11:58:40,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {1124#false} havoc ~x~0; {1124#false} is VALID [2018-11-23 11:58:40,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#false} assume 0 != ~rv~0;~x~0 := 0; {1124#false} is VALID [2018-11-23 11:58:40,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1124#false} is VALID [2018-11-23 11:58:40,895 INFO L256 TraceCheckUtils]: 19: Hoare triple {1124#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1124#false} is VALID [2018-11-23 11:58:40,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#false} ~cond := #in~cond; {1124#false} is VALID [2018-11-23 11:58:40,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {1124#false} assume 0 == ~cond; {1124#false} is VALID [2018-11-23 11:58:40,897 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-23 11:58:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:40,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:40,898 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 11:58:40,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:40,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:58:40,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:41,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-23 11:58:41,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1123#true} is VALID [2018-11-23 11:58:41,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-23 11:58:41,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #77#return; {1123#true} is VALID [2018-11-23 11:58:41,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret9 := main(); {1123#true} is VALID [2018-11-23 11:58:41,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {1147#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:41,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {1147#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1147#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:41,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {1147#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1147#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:41,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {1147#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1126#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {1126#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1126#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {1126#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1126#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {1126#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1127#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {1127#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1127#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {1127#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1127#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {1127#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1128#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {1128#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1124#false} is VALID [2018-11-23 11:58:41,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {1124#false} havoc ~x~0; {1124#false} is VALID [2018-11-23 11:58:41,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#false} assume 0 != ~rv~0;~x~0 := 0; {1124#false} is VALID [2018-11-23 11:58:41,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1124#false} is VALID [2018-11-23 11:58:41,096 INFO L256 TraceCheckUtils]: 19: Hoare triple {1124#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1124#false} is VALID [2018-11-23 11:58:41,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#false} ~cond := #in~cond; {1124#false} is VALID [2018-11-23 11:58:41,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {1124#false} assume 0 == ~cond; {1124#false} is VALID [2018-11-23 11:58:41,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-23 11:58:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:41,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:58:41,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:58:41,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:41,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:58:41,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:41,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:58:41,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:58:41,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:41,149 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 7 states. [2018-11-23 11:58:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,340 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2018-11-23 11:58:41,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:58:41,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:58:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 11:58:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 11:58:41,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-23 11:58:41,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:41,417 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:58:41,417 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:58:41,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:58:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-23 11:58:41,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:41,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2018-11-23 11:58:41,485 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2018-11-23 11:58:41,485 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2018-11-23 11:58:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,488 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-23 11:58:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2018-11-23 11:58:41,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:41,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:41,489 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2018-11-23 11:58:41,489 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2018-11-23 11:58:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,492 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-23 11:58:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2018-11-23 11:58:41,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:41,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:41,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:41,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:58:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 11:58:41,495 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 23 [2018-11-23 11:58:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:41,496 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 11:58:41,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:58:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 11:58:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:58:41,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:41,497 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:41,497 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:41,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1023639264, now seen corresponding path program 4 times [2018-11-23 11:58:41,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:41,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:41,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {1466#true} call ULTIMATE.init(); {1466#true} is VALID [2018-11-23 11:58:41,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {1466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1466#true} is VALID [2018-11-23 11:58:41,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {1466#true} assume true; {1466#true} is VALID [2018-11-23 11:58:41,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} #77#return; {1466#true} is VALID [2018-11-23 11:58:41,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {1466#true} call #t~ret9 := main(); {1466#true} is VALID [2018-11-23 11:58:41,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {1466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {1468#(= main_~i~0 0)} is VALID [2018-11-23 11:58:41,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {1468#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1468#(= main_~i~0 0)} is VALID [2018-11-23 11:58:41,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {1468#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1468#(= main_~i~0 0)} is VALID [2018-11-23 11:58:41,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {1468#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1469#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {1469#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1469#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {1469#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1469#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {1469#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1470#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {1470#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1470#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {1470#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1470#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {1470#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1471#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {1471#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1471#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {1471#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1471#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {1471#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1472#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:41,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {1472#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1467#false} is VALID [2018-11-23 11:58:41,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {1467#false} havoc ~x~0; {1467#false} is VALID [2018-11-23 11:58:41,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {1467#false} assume 0 != ~rv~0;~x~0 := 0; {1467#false} is VALID [2018-11-23 11:58:41,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {1467#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1467#false} is VALID [2018-11-23 11:58:41,661 INFO L256 TraceCheckUtils]: 22: Hoare triple {1467#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1467#false} is VALID [2018-11-23 11:58:41,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {1467#false} ~cond := #in~cond; {1467#false} is VALID [2018-11-23 11:58:41,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#false} assume 0 == ~cond; {1467#false} is VALID [2018-11-23 11:58:41,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {1467#false} assume !false; {1467#false} is VALID [2018-11-23 11:58:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:41,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:41,664 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 11:58:41,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:41,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:41,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:41,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:41,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {1466#true} call ULTIMATE.init(); {1466#true} is VALID [2018-11-23 11:58:41,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {1466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1466#true} is VALID [2018-11-23 11:58:41,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {1466#true} assume true; {1466#true} is VALID [2018-11-23 11:58:41,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} #77#return; {1466#true} is VALID [2018-11-23 11:58:41,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {1466#true} call #t~ret9 := main(); {1466#true} is VALID [2018-11-23 11:58:41,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {1466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:41,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {1491#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:41,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {1491#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:41,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {1491#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1469#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {1469#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1469#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {1469#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1469#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:41,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {1469#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1470#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {1470#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1470#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {1470#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1470#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {1470#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1471#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,931 INFO L273 TraceCheckUtils]: 15: Hoare triple {1471#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1471#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {1471#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1471#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {1471#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1472#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:41,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {1472#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1467#false} is VALID [2018-11-23 11:58:41,934 INFO L273 TraceCheckUtils]: 19: Hoare triple {1467#false} havoc ~x~0; {1467#false} is VALID [2018-11-23 11:58:41,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {1467#false} assume 0 != ~rv~0;~x~0 := 0; {1467#false} is VALID [2018-11-23 11:58:41,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {1467#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1467#false} is VALID [2018-11-23 11:58:41,935 INFO L256 TraceCheckUtils]: 22: Hoare triple {1467#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1467#false} is VALID [2018-11-23 11:58:41,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {1467#false} ~cond := #in~cond; {1467#false} is VALID [2018-11-23 11:58:41,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#false} assume 0 == ~cond; {1467#false} is VALID [2018-11-23 11:58:41,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {1467#false} assume !false; {1467#false} is VALID [2018-11-23 11:58:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:41,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:41,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:58:41,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:58:41,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:41,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:42,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:42,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:42,037 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 8 states. [2018-11-23 11:58:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,198 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2018-11-23 11:58:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:42,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:58:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 11:58:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 11:58:42,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-23 11:58:42,307 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 11:58:42,309 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:58:42,309 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:58:42,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:58:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-23 11:58:42,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:42,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 55 states. [2018-11-23 11:58:42,379 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 55 states. [2018-11-23 11:58:42,379 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 55 states. [2018-11-23 11:58:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,382 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2018-11-23 11:58:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2018-11-23 11:58:42,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,383 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 59 states. [2018-11-23 11:58:42,383 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 59 states. [2018-11-23 11:58:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,386 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2018-11-23 11:58:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2018-11-23 11:58:42,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:42,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:58:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2018-11-23 11:58:42,390 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 26 [2018-11-23 11:58:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:42,390 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2018-11-23 11:58:42,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2018-11-23 11:58:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:58:42,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:42,391 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:42,392 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:42,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1082631200, now seen corresponding path program 5 times [2018-11-23 11:58:42,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:42,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2018-11-23 11:58:42,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {1847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1847#true} is VALID [2018-11-23 11:58:42,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 11:58:42,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #77#return; {1847#true} is VALID [2018-11-23 11:58:42,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret9 := main(); {1847#true} is VALID [2018-11-23 11:58:42,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {1847#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {1849#(= main_~i~0 0)} is VALID [2018-11-23 11:58:42,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {1849#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1849#(= main_~i~0 0)} is VALID [2018-11-23 11:58:42,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {1849#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1849#(= main_~i~0 0)} is VALID [2018-11-23 11:58:42,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {1849#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1850#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:42,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {1850#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1850#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:42,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {1850#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1850#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:42,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {1850#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1851#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:42,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {1851#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1851#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:42,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {1851#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1851#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:42,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {1851#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1852#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:42,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {1852#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1852#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:42,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {1852#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1852#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:42,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {1852#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1853#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:42,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {1853#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1853#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:42,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {1853#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1853#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:42,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {1853#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1854#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {1854#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1848#false} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {1848#false} havoc ~x~0; {1848#false} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {1848#false} assume 0 != ~rv~0;~x~0 := 0; {1848#false} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {1848#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1848#false} is VALID [2018-11-23 11:58:42,614 INFO L256 TraceCheckUtils]: 25: Hoare triple {1848#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1848#false} is VALID [2018-11-23 11:58:42,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {1848#false} ~cond := #in~cond; {1848#false} is VALID [2018-11-23 11:58:42,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {1848#false} assume 0 == ~cond; {1848#false} is VALID [2018-11-23 11:58:42,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2018-11-23 11:58:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:42,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:42,616 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 11:58:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:42,723 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:58:42,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:42,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:42,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2018-11-23 11:58:42,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {1847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1847#true} is VALID [2018-11-23 11:58:42,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 11:58:42,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #77#return; {1847#true} is VALID [2018-11-23 11:58:42,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret9 := main(); {1847#true} is VALID [2018-11-23 11:58:42,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {1847#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {1873#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:42,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {1873#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1873#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:42,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {1873#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1873#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:42,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {1873#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1850#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:42,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {1850#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1850#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:42,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {1850#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1850#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:42,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {1850#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1851#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:42,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {1851#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1851#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:42,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {1851#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1851#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:42,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {1851#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1852#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:42,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {1852#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1852#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:42,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {1852#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1852#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:42,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {1852#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1853#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:42,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {1853#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1853#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:42,961 INFO L273 TraceCheckUtils]: 19: Hoare triple {1853#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1853#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:42,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {1853#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {1854#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:42,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {1854#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1848#false} is VALID [2018-11-23 11:58:42,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {1848#false} havoc ~x~0; {1848#false} is VALID [2018-11-23 11:58:42,971 INFO L273 TraceCheckUtils]: 23: Hoare triple {1848#false} assume 0 != ~rv~0;~x~0 := 0; {1848#false} is VALID [2018-11-23 11:58:42,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {1848#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1848#false} is VALID [2018-11-23 11:58:42,971 INFO L256 TraceCheckUtils]: 25: Hoare triple {1848#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {1848#false} is VALID [2018-11-23 11:58:42,972 INFO L273 TraceCheckUtils]: 26: Hoare triple {1848#false} ~cond := #in~cond; {1848#false} is VALID [2018-11-23 11:58:42,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {1848#false} assume 0 == ~cond; {1848#false} is VALID [2018-11-23 11:58:42,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2018-11-23 11:58:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:42,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:42,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:58:42,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:58:42,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:42,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:58:43,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:43,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:58:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:58:43,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:43,094 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 9 states. [2018-11-23 11:58:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,607 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 11:58:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:43,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:58:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 11:58:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 11:58:43,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2018-11-23 11:58:43,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 11:58:43,732 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:58:43,732 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:58:43,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:58:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-11-23 11:58:43,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:43,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 61 states. [2018-11-23 11:58:43,774 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 61 states. [2018-11-23 11:58:43,774 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 61 states. [2018-11-23 11:58:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,781 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2018-11-23 11:58:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2018-11-23 11:58:43,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,782 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 65 states. [2018-11-23 11:58:43,782 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 65 states. [2018-11-23 11:58:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,784 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2018-11-23 11:58:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2018-11-23 11:58:43,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:43,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:58:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2018-11-23 11:58:43,787 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 29 [2018-11-23 11:58:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:43,787 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2018-11-23 11:58:43,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:58:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-23 11:58:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:58:43,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:43,788 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:43,788 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:43,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1869772512, now seen corresponding path program 6 times [2018-11-23 11:58:43,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:43,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:43,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:43,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:44,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {2266#true} call ULTIMATE.init(); {2266#true} is VALID [2018-11-23 11:58:44,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {2266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2266#true} is VALID [2018-11-23 11:58:44,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {2266#true} assume true; {2266#true} is VALID [2018-11-23 11:58:44,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2266#true} {2266#true} #77#return; {2266#true} is VALID [2018-11-23 11:58:44,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {2266#true} call #t~ret9 := main(); {2266#true} is VALID [2018-11-23 11:58:44,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {2266#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {2268#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {2268#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2268#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {2268#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2268#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {2268#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2269#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {2269#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2269#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {2269#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2269#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {2269#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2270#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {2270#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2270#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {2270#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2270#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2271#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:44,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {2271#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2271#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:44,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {2271#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2271#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:44,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {2271#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2272#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:44,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {2272#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2272#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:44,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {2272#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2272#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:44,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {2272#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2273#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:44,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {2273#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2273#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:44,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {2273#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2273#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:44,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {2273#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2274#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:44,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {2274#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2267#false} is VALID [2018-11-23 11:58:44,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {2267#false} havoc ~x~0; {2267#false} is VALID [2018-11-23 11:58:44,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {2267#false} assume 0 != ~rv~0;~x~0 := 0; {2267#false} is VALID [2018-11-23 11:58:44,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {2267#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2267#false} is VALID [2018-11-23 11:58:44,384 INFO L256 TraceCheckUtils]: 28: Hoare triple {2267#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2267#false} is VALID [2018-11-23 11:58:44,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {2267#false} ~cond := #in~cond; {2267#false} is VALID [2018-11-23 11:58:44,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {2267#false} assume 0 == ~cond; {2267#false} is VALID [2018-11-23 11:58:44,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {2267#false} assume !false; {2267#false} is VALID [2018-11-23 11:58:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:44,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:44,386 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 11:58:44,405 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:44,444 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:58:44,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:44,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:44,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {2266#true} call ULTIMATE.init(); {2266#true} is VALID [2018-11-23 11:58:44,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {2266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2266#true} is VALID [2018-11-23 11:58:44,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {2266#true} assume true; {2266#true} is VALID [2018-11-23 11:58:44,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2266#true} {2266#true} #77#return; {2266#true} is VALID [2018-11-23 11:58:44,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {2266#true} call #t~ret9 := main(); {2266#true} is VALID [2018-11-23 11:58:44,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {2266#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {2293#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {2293#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2293#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {2293#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2293#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {2293#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2269#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {2269#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2269#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {2269#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2269#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {2269#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2270#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {2270#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2270#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {2270#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2270#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2271#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:44,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {2271#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2271#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:44,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {2271#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2271#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:44,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {2271#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2272#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:44,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {2272#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2272#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:44,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {2272#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2272#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:44,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {2272#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2273#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:44,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {2273#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2273#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:44,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {2273#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2273#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:44,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {2273#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2274#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:44,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {2274#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2267#false} is VALID [2018-11-23 11:58:44,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {2267#false} havoc ~x~0; {2267#false} is VALID [2018-11-23 11:58:44,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {2267#false} assume 0 != ~rv~0;~x~0 := 0; {2267#false} is VALID [2018-11-23 11:58:44,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {2267#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2267#false} is VALID [2018-11-23 11:58:44,636 INFO L256 TraceCheckUtils]: 28: Hoare triple {2267#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2267#false} is VALID [2018-11-23 11:58:44,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {2267#false} ~cond := #in~cond; {2267#false} is VALID [2018-11-23 11:58:44,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {2267#false} assume 0 == ~cond; {2267#false} is VALID [2018-11-23 11:58:44,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {2267#false} assume !false; {2267#false} is VALID [2018-11-23 11:58:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:44,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:44,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:58:44,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:58:44,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:44,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:58:44,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:44,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:58:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:58:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:44,844 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 10 states. [2018-11-23 11:58:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,373 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-11-23 11:58:45,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:58:45,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:58:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 11:58:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 11:58:45,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2018-11-23 11:58:45,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:45,500 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:58:45,501 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:58:45,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:58:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-23 11:58:45,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:45,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 67 states. [2018-11-23 11:58:45,615 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 67 states. [2018-11-23 11:58:45,615 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 67 states. [2018-11-23 11:58:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,618 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2018-11-23 11:58:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2018-11-23 11:58:45,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:45,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:45,619 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 71 states. [2018-11-23 11:58:45,620 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 71 states. [2018-11-23 11:58:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,622 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2018-11-23 11:58:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2018-11-23 11:58:45,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:45,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:45,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:45,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:58:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2018-11-23 11:58:45,626 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 32 [2018-11-23 11:58:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:45,626 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2018-11-23 11:58:45,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:58:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-23 11:58:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:58:45,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:45,627 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:45,628 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:45,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:45,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1075162144, now seen corresponding path program 7 times [2018-11-23 11:58:45,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:45,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:45,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2723#true} is VALID [2018-11-23 11:58:45,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {2723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2723#true} is VALID [2018-11-23 11:58:45,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2018-11-23 11:58:45,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #77#return; {2723#true} is VALID [2018-11-23 11:58:45,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret9 := main(); {2723#true} is VALID [2018-11-23 11:58:45,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {2725#(= main_~i~0 0)} is VALID [2018-11-23 11:58:45,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {2725#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2725#(= main_~i~0 0)} is VALID [2018-11-23 11:58:45,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {2725#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2725#(= main_~i~0 0)} is VALID [2018-11-23 11:58:45,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {2725#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2726#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {2726#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {2726#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2726#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {2726#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2727#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {2727#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {2727#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2727#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {2727#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2728#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {2728#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {2728#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2728#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {2728#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2729#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {2729#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {2729#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2729#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2730#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {2730#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2730#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2731#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2731#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {2731#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2732#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2724#false} is VALID [2018-11-23 11:58:45,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {2724#false} havoc ~x~0; {2724#false} is VALID [2018-11-23 11:58:45,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {2724#false} assume 0 != ~rv~0;~x~0 := 0; {2724#false} is VALID [2018-11-23 11:58:45,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {2724#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2724#false} is VALID [2018-11-23 11:58:45,802 INFO L256 TraceCheckUtils]: 31: Hoare triple {2724#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2724#false} is VALID [2018-11-23 11:58:45,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2018-11-23 11:58:45,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2018-11-23 11:58:45,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2018-11-23 11:58:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:45,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:45,805 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 11:58:45,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:45,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {2723#true} call ULTIMATE.init(); {2723#true} is VALID [2018-11-23 11:58:45,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {2723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2723#true} is VALID [2018-11-23 11:58:45,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {2723#true} assume true; {2723#true} is VALID [2018-11-23 11:58:45,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2723#true} {2723#true} #77#return; {2723#true} is VALID [2018-11-23 11:58:45,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {2723#true} call #t~ret9 := main(); {2723#true} is VALID [2018-11-23 11:58:46,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {2723#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {2751#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:46,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {2751#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2751#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:46,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {2751#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2751#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:46,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {2751#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2726#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:46,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {2726#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:46,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {2726#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2726#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:46,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {2726#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2727#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:46,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {2727#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:46,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {2727#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2727#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:46,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {2727#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2728#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:46,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {2728#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:46,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {2728#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2728#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:46,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {2728#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2729#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:46,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {2729#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:46,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {2729#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2729#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:46,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2730#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:46,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {2730#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:46,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2730#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:46,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2731#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:46,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:46,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2731#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:46,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {2731#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {2732#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:46,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2724#false} is VALID [2018-11-23 11:58:46,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {2724#false} havoc ~x~0; {2724#false} is VALID [2018-11-23 11:58:46,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {2724#false} assume 0 != ~rv~0;~x~0 := 0; {2724#false} is VALID [2018-11-23 11:58:46,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {2724#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2724#false} is VALID [2018-11-23 11:58:46,021 INFO L256 TraceCheckUtils]: 31: Hoare triple {2724#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {2724#false} is VALID [2018-11-23 11:58:46,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {2724#false} ~cond := #in~cond; {2724#false} is VALID [2018-11-23 11:58:46,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {2724#false} assume 0 == ~cond; {2724#false} is VALID [2018-11-23 11:58:46,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {2724#false} assume !false; {2724#false} is VALID [2018-11-23 11:58:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:46,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:46,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:58:46,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 11:58:46,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:46,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:58:46,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:46,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:58:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:58:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:58:46,092 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 11 states. [2018-11-23 11:58:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,595 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2018-11-23 11:58:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:58:46,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 11:58:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:58:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 11:58:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:58:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 11:58:46,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2018-11-23 11:58:46,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:46,720 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:58:46,720 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:58:46,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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 11:58:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:58:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-23 11:58:46,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:46,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 73 states. [2018-11-23 11:58:46,747 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 73 states. [2018-11-23 11:58:46,747 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 73 states. [2018-11-23 11:58:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,751 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-11-23 11:58:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2018-11-23 11:58:46,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:46,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:46,752 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 77 states. [2018-11-23 11:58:46,752 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 77 states. [2018-11-23 11:58:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,754 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-11-23 11:58:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2018-11-23 11:58:46,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:46,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:46,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:46,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 11:58:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-11-23 11:58:46,757 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 35 [2018-11-23 11:58:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:46,757 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-11-23 11:58:46,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:58:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 11:58:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:58:46,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:46,758 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:46,759 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:46,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1597542688, now seen corresponding path program 8 times [2018-11-23 11:58:46,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:46,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:46,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:46,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {3218#true} call ULTIMATE.init(); {3218#true} is VALID [2018-11-23 11:58:46,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {3218#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3218#true} is VALID [2018-11-23 11:58:46,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {3218#true} assume true; {3218#true} is VALID [2018-11-23 11:58:46,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3218#true} {3218#true} #77#return; {3218#true} is VALID [2018-11-23 11:58:46,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {3218#true} call #t~ret9 := main(); {3218#true} is VALID [2018-11-23 11:58:46,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {3218#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {3220#(= main_~i~0 0)} is VALID [2018-11-23 11:58:46,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {3220#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3220#(= main_~i~0 0)} is VALID [2018-11-23 11:58:46,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {3220#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3220#(= main_~i~0 0)} is VALID [2018-11-23 11:58:46,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {3220#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3221#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:46,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {3221#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3221#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:46,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {3221#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3221#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:46,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {3221#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3222#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:46,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {3222#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3222#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:46,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {3222#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3222#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:46,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {3222#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3223#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:46,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {3223#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3223#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:46,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {3223#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3223#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:46,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {3223#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3224#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:46,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {3224#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3224#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:46,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {3224#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3224#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:46,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {3224#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3225#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:46,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {3225#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3225#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:46,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {3225#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3225#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:46,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {3225#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3226#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:46,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {3226#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3226#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:46,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {3226#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3226#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:46,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {3226#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3227#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:46,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {3227#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3227#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:46,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {3227#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3227#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:46,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {3227#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3228#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:46,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {3228#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3219#false} is VALID [2018-11-23 11:58:46,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {3219#false} havoc ~x~0; {3219#false} is VALID [2018-11-23 11:58:46,991 INFO L273 TraceCheckUtils]: 32: Hoare triple {3219#false} assume 0 != ~rv~0;~x~0 := 0; {3219#false} is VALID [2018-11-23 11:58:46,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {3219#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3219#false} is VALID [2018-11-23 11:58:46,992 INFO L256 TraceCheckUtils]: 34: Hoare triple {3219#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3219#false} is VALID [2018-11-23 11:58:46,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {3219#false} ~cond := #in~cond; {3219#false} is VALID [2018-11-23 11:58:46,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {3219#false} assume 0 == ~cond; {3219#false} is VALID [2018-11-23 11:58:46,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {3219#false} assume !false; {3219#false} is VALID [2018-11-23 11:58:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:46,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:46,994 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 11:58:47,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:47,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:47,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:47,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:47,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {3218#true} call ULTIMATE.init(); {3218#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {3218#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3218#true} is VALID [2018-11-23 11:58:47,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {3218#true} assume true; {3218#true} is VALID [2018-11-23 11:58:47,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3218#true} {3218#true} #77#return; {3218#true} is VALID [2018-11-23 11:58:47,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {3218#true} call #t~ret9 := main(); {3218#true} is VALID [2018-11-23 11:58:47,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {3218#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {3247#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {3247#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {3247#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3247#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:47,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {3247#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3221#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {3221#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3221#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {3221#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3221#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {3221#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3222#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {3222#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3222#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {3222#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3222#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {3222#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3223#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {3223#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3223#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {3223#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3223#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {3223#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3224#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {3224#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3224#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {3224#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3224#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {3224#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3225#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {3225#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3225#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,175 INFO L273 TraceCheckUtils]: 22: Hoare triple {3225#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3225#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {3225#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3226#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {3226#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3226#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {3226#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3226#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:47,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {3226#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3227#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,178 INFO L273 TraceCheckUtils]: 27: Hoare triple {3227#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3227#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,179 INFO L273 TraceCheckUtils]: 28: Hoare triple {3227#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3227#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:47,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {3227#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3228#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:47,180 INFO L273 TraceCheckUtils]: 30: Hoare triple {3228#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3219#false} is VALID [2018-11-23 11:58:47,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {3219#false} havoc ~x~0; {3219#false} is VALID [2018-11-23 11:58:47,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {3219#false} assume 0 != ~rv~0;~x~0 := 0; {3219#false} is VALID [2018-11-23 11:58:47,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {3219#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3219#false} is VALID [2018-11-23 11:58:47,181 INFO L256 TraceCheckUtils]: 34: Hoare triple {3219#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3219#false} is VALID [2018-11-23 11:58:47,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {3219#false} ~cond := #in~cond; {3219#false} is VALID [2018-11-23 11:58:47,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {3219#false} assume 0 == ~cond; {3219#false} is VALID [2018-11-23 11:58:47,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {3219#false} assume !false; {3219#false} is VALID [2018-11-23 11:58:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:47,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:47,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:58:47,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-23 11:58:47,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:47,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:47,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:47,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:47,243 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 12 states. [2018-11-23 11:58:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,600 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2018-11-23 11:58:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:58:47,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-23 11:58:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 11:58:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 11:58:47,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-23 11:58:47,775 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 11:58:47,776 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:58:47,776 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:58:47,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 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 11:58:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:58:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-23 11:58:47,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:47,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 79 states. [2018-11-23 11:58:47,839 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 79 states. [2018-11-23 11:58:47,839 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 79 states. [2018-11-23 11:58:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,841 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2018-11-23 11:58:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2018-11-23 11:58:47,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,842 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 83 states. [2018-11-23 11:58:47,842 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 83 states. [2018-11-23 11:58:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,844 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2018-11-23 11:58:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2018-11-23 11:58:47,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:47,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:58:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-11-23 11:58:47,847 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 38 [2018-11-23 11:58:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:47,847 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-11-23 11:58:47,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-11-23 11:58:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:58:47,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:47,848 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:47,848 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:47,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash 251507744, now seen corresponding path program 9 times [2018-11-23 11:58:47,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:47,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3751#true} is VALID [2018-11-23 11:58:48,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {3751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3751#true} is VALID [2018-11-23 11:58:48,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2018-11-23 11:58:48,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #77#return; {3751#true} is VALID [2018-11-23 11:58:48,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret9 := main(); {3751#true} is VALID [2018-11-23 11:58:48,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {3751#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {3753#(= main_~i~0 0)} is VALID [2018-11-23 11:58:48,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {3753#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3753#(= main_~i~0 0)} is VALID [2018-11-23 11:58:48,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {3753#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3753#(= main_~i~0 0)} is VALID [2018-11-23 11:58:48,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {3753#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3754#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {3754#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3754#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {3754#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3754#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {3754#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3755#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {3755#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3755#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {3755#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3755#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {3755#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3756#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {3756#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3756#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {3756#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3756#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {3756#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3757#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {3757#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3757#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {3757#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3757#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {3757#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3758#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {3758#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3758#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {3758#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3758#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {3758#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3759#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {3759#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3759#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {3759#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3759#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,121 INFO L273 TraceCheckUtils]: 26: Hoare triple {3759#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3760#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {3760#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3760#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {3760#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3760#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {3760#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3761#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {3761#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3761#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {3761#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3761#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {3761#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3762#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {3762#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3752#false} is VALID [2018-11-23 11:58:48,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {3752#false} havoc ~x~0; {3752#false} is VALID [2018-11-23 11:58:48,157 INFO L273 TraceCheckUtils]: 35: Hoare triple {3752#false} assume 0 != ~rv~0;~x~0 := 0; {3752#false} is VALID [2018-11-23 11:58:48,157 INFO L273 TraceCheckUtils]: 36: Hoare triple {3752#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3752#false} is VALID [2018-11-23 11:58:48,157 INFO L256 TraceCheckUtils]: 37: Hoare triple {3752#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3752#false} is VALID [2018-11-23 11:58:48,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {3752#false} ~cond := #in~cond; {3752#false} is VALID [2018-11-23 11:58:48,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {3752#false} assume 0 == ~cond; {3752#false} is VALID [2018-11-23 11:58:48,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {3752#false} assume !false; {3752#false} is VALID [2018-11-23 11:58:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:48,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:48,160 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 11:58:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:48,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 11:58:48,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:48,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3751#true} is VALID [2018-11-23 11:58:48,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {3751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3751#true} is VALID [2018-11-23 11:58:48,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2018-11-23 11:58:48,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #77#return; {3751#true} is VALID [2018-11-23 11:58:48,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret9 := main(); {3751#true} is VALID [2018-11-23 11:58:48,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {3751#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {3781#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:48,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {3781#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3781#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:48,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {3781#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3781#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:48,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {3781#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3754#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {3754#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3754#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {3754#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3754#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {3754#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3755#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {3755#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3755#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {3755#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3755#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {3755#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3756#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {3756#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3756#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {3756#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3756#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {3756#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3757#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {3757#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3757#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {3757#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3757#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {3757#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3758#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {3758#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3758#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {3758#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3758#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {3758#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3759#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {3759#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3759#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {3759#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3759#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,482 INFO L273 TraceCheckUtils]: 26: Hoare triple {3759#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3760#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {3760#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3760#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {3760#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3760#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,485 INFO L273 TraceCheckUtils]: 29: Hoare triple {3760#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3761#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {3761#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3761#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {3761#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3761#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {3761#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {3762#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {3762#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3752#false} is VALID [2018-11-23 11:58:48,488 INFO L273 TraceCheckUtils]: 34: Hoare triple {3752#false} havoc ~x~0; {3752#false} is VALID [2018-11-23 11:58:48,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {3752#false} assume 0 != ~rv~0;~x~0 := 0; {3752#false} is VALID [2018-11-23 11:58:48,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {3752#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3752#false} is VALID [2018-11-23 11:58:48,489 INFO L256 TraceCheckUtils]: 37: Hoare triple {3752#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {3752#false} is VALID [2018-11-23 11:58:48,489 INFO L273 TraceCheckUtils]: 38: Hoare triple {3752#false} ~cond := #in~cond; {3752#false} is VALID [2018-11-23 11:58:48,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {3752#false} assume 0 == ~cond; {3752#false} is VALID [2018-11-23 11:58:48,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {3752#false} assume !false; {3752#false} is VALID [2018-11-23 11:58:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:48,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:58:48,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-23 11:58:48,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:48,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:58:48,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:48,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:58:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:58:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:48,583 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 13 states. [2018-11-23 11:58:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,788 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2018-11-23 11:58:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:58:48,788 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-23 11:58:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 92 transitions. [2018-11-23 11:58:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 92 transitions. [2018-11-23 11:58:48,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 92 transitions. [2018-11-23 11:58:48,876 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 11:58:48,878 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:58:48,878 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:58:48,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:58:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-11-23 11:58:48,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:48,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2018-11-23 11:58:48,923 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2018-11-23 11:58:48,924 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2018-11-23 11:58:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,927 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 11:58:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2018-11-23 11:58:48,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:48,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:48,928 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2018-11-23 11:58:48,928 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2018-11-23 11:58:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,930 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 11:58:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2018-11-23 11:58:48,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:48,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:48,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:48,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 11:58:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2018-11-23 11:58:48,933 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 41 [2018-11-23 11:58:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:48,934 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2018-11-23 11:58:48,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:58:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 11:58:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:58:48,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:48,935 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:48,935 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:48,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1937611040, now seen corresponding path program 10 times [2018-11-23 11:58:48,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:48,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:48,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {4322#true} call ULTIMATE.init(); {4322#true} is VALID [2018-11-23 11:58:50,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {4322#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4322#true} is VALID [2018-11-23 11:58:50,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {4322#true} assume true; {4322#true} is VALID [2018-11-23 11:58:50,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4322#true} {4322#true} #77#return; {4322#true} is VALID [2018-11-23 11:58:50,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {4322#true} call #t~ret9 := main(); {4322#true} is VALID [2018-11-23 11:58:50,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {4322#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {4324#(= main_~i~0 0)} is VALID [2018-11-23 11:58:50,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {4324#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4324#(= main_~i~0 0)} is VALID [2018-11-23 11:58:50,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {4324#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4324#(= main_~i~0 0)} is VALID [2018-11-23 11:58:50,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {4324#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4325#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {4325#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4325#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {4325#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4325#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {4325#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4326#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {4326#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4326#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {4326#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4326#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {4326#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4327#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {4327#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4327#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {4327#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4327#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {4327#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4328#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {4328#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4328#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {4328#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4328#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {4328#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4329#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {4329#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4329#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {4329#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4329#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {4329#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4330#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {4330#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4330#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {4330#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4330#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {4330#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4331#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {4331#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4331#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {4331#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4331#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {4331#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4332#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {4332#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4332#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {4332#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4332#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {4332#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4333#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {4333#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4333#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {4333#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4333#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {4333#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4334#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {4334#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4323#false} is VALID [2018-11-23 11:58:50,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {4323#false} havoc ~x~0; {4323#false} is VALID [2018-11-23 11:58:50,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {4323#false} assume 0 != ~rv~0;~x~0 := 0; {4323#false} is VALID [2018-11-23 11:58:50,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {4323#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4323#false} is VALID [2018-11-23 11:58:50,174 INFO L256 TraceCheckUtils]: 40: Hoare triple {4323#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4323#false} is VALID [2018-11-23 11:58:50,175 INFO L273 TraceCheckUtils]: 41: Hoare triple {4323#false} ~cond := #in~cond; {4323#false} is VALID [2018-11-23 11:58:50,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {4323#false} assume 0 == ~cond; {4323#false} is VALID [2018-11-23 11:58:50,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {4323#false} assume !false; {4323#false} is VALID [2018-11-23 11:58:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:50,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:50,177 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 11:58:50,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:50,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:50,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:50,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {4322#true} call ULTIMATE.init(); {4322#true} is VALID [2018-11-23 11:58:50,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {4322#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4322#true} is VALID [2018-11-23 11:58:50,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {4322#true} assume true; {4322#true} is VALID [2018-11-23 11:58:50,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4322#true} {4322#true} #77#return; {4322#true} is VALID [2018-11-23 11:58:50,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {4322#true} call #t~ret9 := main(); {4322#true} is VALID [2018-11-23 11:58:50,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {4322#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {4353#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:50,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {4353#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4353#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:50,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {4353#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4353#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:50,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {4353#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4325#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {4325#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4325#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {4325#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4325#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {4325#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4326#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {4326#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4326#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {4326#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4326#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {4326#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4327#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {4327#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4327#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {4327#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4327#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {4327#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4328#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {4328#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4328#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {4328#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4328#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {4328#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4329#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {4329#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4329#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {4329#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4329#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {4329#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4330#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {4330#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4330#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {4330#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4330#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {4330#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4331#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {4331#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4331#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {4331#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4331#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {4331#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4332#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {4332#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4332#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {4332#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4332#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {4332#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4333#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {4333#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4333#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {4333#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4333#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {4333#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4334#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {4334#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4323#false} is VALID [2018-11-23 11:58:50,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {4323#false} havoc ~x~0; {4323#false} is VALID [2018-11-23 11:58:50,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {4323#false} assume 0 != ~rv~0;~x~0 := 0; {4323#false} is VALID [2018-11-23 11:58:50,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {4323#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4323#false} is VALID [2018-11-23 11:58:50,454 INFO L256 TraceCheckUtils]: 40: Hoare triple {4323#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4323#false} is VALID [2018-11-23 11:58:50,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {4323#false} ~cond := #in~cond; {4323#false} is VALID [2018-11-23 11:58:50,454 INFO L273 TraceCheckUtils]: 42: Hoare triple {4323#false} assume 0 == ~cond; {4323#false} is VALID [2018-11-23 11:58:50,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {4323#false} assume !false; {4323#false} is VALID [2018-11-23 11:58:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:50,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:50,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:58:50,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 11:58:50,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:50,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:58:50,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:50,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:58:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:58:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:50,537 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 14 states. [2018-11-23 11:58:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:50,934 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2018-11-23 11:58:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:58:50,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 11:58:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 11:58:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 11:58:50,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-23 11:58:51,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:51,403 INFO L225 Difference]: With dead ends: 114 [2018-11-23 11:58:51,403 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 11:58:51,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 11:58:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-11-23 11:58:51,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:51,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 91 states. [2018-11-23 11:58:51,441 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 91 states. [2018-11-23 11:58:51,441 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 91 states. [2018-11-23 11:58:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,444 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2018-11-23 11:58:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-11-23 11:58:51,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:51,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:51,445 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 95 states. [2018-11-23 11:58:51,445 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 95 states. [2018-11-23 11:58:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,448 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2018-11-23 11:58:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-11-23 11:58:51,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:51,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:51,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:51,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 11:58:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-11-23 11:58:51,451 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 44 [2018-11-23 11:58:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:51,452 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-11-23 11:58:51,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:58:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-11-23 11:58:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:58:51,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:51,453 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:51,453 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:51,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1103084576, now seen corresponding path program 11 times [2018-11-23 11:58:51,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:51,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:51,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:52,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {4931#true} call ULTIMATE.init(); {4931#true} is VALID [2018-11-23 11:58:52,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {4931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4931#true} is VALID [2018-11-23 11:58:52,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {4931#true} assume true; {4931#true} is VALID [2018-11-23 11:58:52,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4931#true} {4931#true} #77#return; {4931#true} is VALID [2018-11-23 11:58:52,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {4931#true} call #t~ret9 := main(); {4931#true} is VALID [2018-11-23 11:58:52,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {4931#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {4933#(= main_~i~0 0)} is VALID [2018-11-23 11:58:52,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {4933#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4933#(= main_~i~0 0)} is VALID [2018-11-23 11:58:52,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {4933#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4933#(= main_~i~0 0)} is VALID [2018-11-23 11:58:52,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {4933#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4934#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {4934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4934#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {4934#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4934#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {4934#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4935#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4935#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {4935#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4935#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {4935#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4936#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {4936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4936#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {4936#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4936#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {4936#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4937#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {4937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4937#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {4937#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4937#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {4937#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4938#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {4938#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4938#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {4938#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4938#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {4938#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4939#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {4939#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4939#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {4939#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4939#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {4939#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4940#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {4940#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4940#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {4940#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4940#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {4940#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4941#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {4941#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4941#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {4941#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4941#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {4941#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4942#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {4942#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4942#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {4942#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4942#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {4942#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4943#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {4943#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4943#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {4943#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4943#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {4943#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4944#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {4944#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4932#false} is VALID [2018-11-23 11:58:52,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {4932#false} havoc ~x~0; {4932#false} is VALID [2018-11-23 11:58:52,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {4932#false} assume 0 != ~rv~0;~x~0 := 0; {4932#false} is VALID [2018-11-23 11:58:52,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {4932#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4932#false} is VALID [2018-11-23 11:58:52,512 INFO L256 TraceCheckUtils]: 43: Hoare triple {4932#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4932#false} is VALID [2018-11-23 11:58:52,513 INFO L273 TraceCheckUtils]: 44: Hoare triple {4932#false} ~cond := #in~cond; {4932#false} is VALID [2018-11-23 11:58:52,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {4932#false} assume 0 == ~cond; {4932#false} is VALID [2018-11-23 11:58:52,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {4932#false} assume !false; {4932#false} is VALID [2018-11-23 11:58:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:52,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:52,518 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 11:58:52,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:52,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:58:52,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:52,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:52,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {4931#true} call ULTIMATE.init(); {4931#true} is VALID [2018-11-23 11:58:52,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {4931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4931#true} is VALID [2018-11-23 11:58:52,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {4931#true} assume true; {4931#true} is VALID [2018-11-23 11:58:52,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4931#true} {4931#true} #77#return; {4931#true} is VALID [2018-11-23 11:58:52,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {4931#true} call #t~ret9 := main(); {4931#true} is VALID [2018-11-23 11:58:52,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {4931#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {4963#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:52,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {4963#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:52,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {4963#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4963#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:52,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {4963#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4934#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {4934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4934#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {4934#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4934#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {4934#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4935#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4935#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {4935#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4935#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {4935#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4936#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {4936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4936#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {4936#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4936#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {4936#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4937#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {4937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4937#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {4937#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4937#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {4937#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4938#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,964 INFO L273 TraceCheckUtils]: 21: Hoare triple {4938#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4938#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {4938#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4938#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {4938#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4939#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {4939#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4939#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {4939#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4939#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {4939#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4940#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {4940#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4940#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {4940#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4940#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {4940#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4941#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {4941#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4941#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {4941#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4941#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {4941#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4942#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {4942#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4942#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {4942#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4942#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {4942#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4943#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {4943#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4943#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,974 INFO L273 TraceCheckUtils]: 37: Hoare triple {4943#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4943#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {4943#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {4944#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {4944#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4932#false} is VALID [2018-11-23 11:58:52,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {4932#false} havoc ~x~0; {4932#false} is VALID [2018-11-23 11:58:52,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {4932#false} assume 0 != ~rv~0;~x~0 := 0; {4932#false} is VALID [2018-11-23 11:58:52,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {4932#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4932#false} is VALID [2018-11-23 11:58:52,977 INFO L256 TraceCheckUtils]: 43: Hoare triple {4932#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {4932#false} is VALID [2018-11-23 11:58:52,977 INFO L273 TraceCheckUtils]: 44: Hoare triple {4932#false} ~cond := #in~cond; {4932#false} is VALID [2018-11-23 11:58:52,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {4932#false} assume 0 == ~cond; {4932#false} is VALID [2018-11-23 11:58:52,977 INFO L273 TraceCheckUtils]: 46: Hoare triple {4932#false} assume !false; {4932#false} is VALID [2018-11-23 11:58:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:52,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:52,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:58:52,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-23 11:58:52,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:52,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:58:53,048 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 11:58:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:58:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:58:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:53,050 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 15 states. [2018-11-23 11:58:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,461 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2018-11-23 11:58:53,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:58:53,461 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-23 11:58:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:58:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2018-11-23 11:58:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:58:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2018-11-23 11:58:53,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 100 transitions. [2018-11-23 11:58:53,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:53,590 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:58:53,590 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:58:53,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:58:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-11-23 11:58:53,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:53,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 97 states. [2018-11-23 11:58:53,721 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 97 states. [2018-11-23 11:58:53,721 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 97 states. [2018-11-23 11:58:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,724 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-11-23 11:58:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2018-11-23 11:58:53,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,724 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 101 states. [2018-11-23 11:58:53,724 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 101 states. [2018-11-23 11:58:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,727 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-11-23 11:58:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2018-11-23 11:58:53,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:53,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 11:58:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2018-11-23 11:58:53,730 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 47 [2018-11-23 11:58:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:53,730 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2018-11-23 11:58:53,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:58:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 11:58:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:58:53,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:53,730 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:53,731 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:53,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1310940896, now seen corresponding path program 12 times [2018-11-23 11:58:53,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:53,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:53,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {5578#true} call ULTIMATE.init(); {5578#true} is VALID [2018-11-23 11:58:53,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {5578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5578#true} is VALID [2018-11-23 11:58:53,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {5578#true} assume true; {5578#true} is VALID [2018-11-23 11:58:53,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5578#true} {5578#true} #77#return; {5578#true} is VALID [2018-11-23 11:58:53,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {5578#true} call #t~ret9 := main(); {5578#true} is VALID [2018-11-23 11:58:53,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {5578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {5580#(= main_~i~0 0)} is VALID [2018-11-23 11:58:53,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {5580#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5580#(= main_~i~0 0)} is VALID [2018-11-23 11:58:53,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {5580#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5580#(= main_~i~0 0)} is VALID [2018-11-23 11:58:53,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {5580#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:53,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {5581#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:53,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {5581#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:53,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {5581#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {5582#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {5582#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {5582#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {5583#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {5583#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {5583#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {5584#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {5584#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {5584#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {5585#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {5585#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {5585#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {5586#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {5586#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {5586#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {5587#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {5587#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {5587#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {5588#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {5588#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,055 INFO L273 TraceCheckUtils]: 32: Hoare triple {5588#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {5589#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {5589#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {5589#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {5590#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,094 INFO L273 TraceCheckUtils]: 37: Hoare triple {5590#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {5590#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {5591#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {5591#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {5591#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5592#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {5592#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5579#false} is VALID [2018-11-23 11:58:54,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {5579#false} havoc ~x~0; {5579#false} is VALID [2018-11-23 11:58:54,100 INFO L273 TraceCheckUtils]: 44: Hoare triple {5579#false} assume 0 != ~rv~0;~x~0 := 0; {5579#false} is VALID [2018-11-23 11:58:54,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {5579#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5579#false} is VALID [2018-11-23 11:58:54,100 INFO L256 TraceCheckUtils]: 46: Hoare triple {5579#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5579#false} is VALID [2018-11-23 11:58:54,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {5579#false} ~cond := #in~cond; {5579#false} is VALID [2018-11-23 11:58:54,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {5579#false} assume 0 == ~cond; {5579#false} is VALID [2018-11-23 11:58:54,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {5579#false} assume !false; {5579#false} is VALID [2018-11-23 11:58:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:54,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:54,102 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 11:58:54,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:54,276 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:58:54,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:54,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:54,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {5578#true} call ULTIMATE.init(); {5578#true} is VALID [2018-11-23 11:58:54,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {5578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5578#true} is VALID [2018-11-23 11:58:54,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {5578#true} assume true; {5578#true} is VALID [2018-11-23 11:58:54,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5578#true} {5578#true} #77#return; {5578#true} is VALID [2018-11-23 11:58:54,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {5578#true} call #t~ret9 := main(); {5578#true} is VALID [2018-11-23 11:58:54,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {5578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {5611#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:54,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {5611#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5611#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:54,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {5611#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5611#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:54,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {5611#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {5581#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {5581#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5581#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:54,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {5581#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {5582#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {5582#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5582#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {5582#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {5583#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {5583#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5583#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {5583#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {5584#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {5584#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5584#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {5584#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {5585#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {5585#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5585#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {5585#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {5586#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {5586#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5586#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {5586#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {5587#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {5587#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5587#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {5587#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {5588#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {5588#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5588#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {5588#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {5589#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {5589#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5589#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {5589#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {5590#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {5590#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5590#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,428 INFO L273 TraceCheckUtils]: 38: Hoare triple {5590#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,429 INFO L273 TraceCheckUtils]: 39: Hoare triple {5591#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,429 INFO L273 TraceCheckUtils]: 40: Hoare triple {5591#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5591#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,430 INFO L273 TraceCheckUtils]: 41: Hoare triple {5591#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {5592#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,431 INFO L273 TraceCheckUtils]: 42: Hoare triple {5592#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5579#false} is VALID [2018-11-23 11:58:54,431 INFO L273 TraceCheckUtils]: 43: Hoare triple {5579#false} havoc ~x~0; {5579#false} is VALID [2018-11-23 11:58:54,431 INFO L273 TraceCheckUtils]: 44: Hoare triple {5579#false} assume 0 != ~rv~0;~x~0 := 0; {5579#false} is VALID [2018-11-23 11:58:54,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {5579#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5579#false} is VALID [2018-11-23 11:58:54,432 INFO L256 TraceCheckUtils]: 46: Hoare triple {5579#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {5579#false} is VALID [2018-11-23 11:58:54,432 INFO L273 TraceCheckUtils]: 47: Hoare triple {5579#false} ~cond := #in~cond; {5579#false} is VALID [2018-11-23 11:58:54,432 INFO L273 TraceCheckUtils]: 48: Hoare triple {5579#false} assume 0 == ~cond; {5579#false} is VALID [2018-11-23 11:58:54,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {5579#false} assume !false; {5579#false} is VALID [2018-11-23 11:58:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:54,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:54,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:58:54,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-23 11:58:54,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:54,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:58:54,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:58:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:58:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:54,609 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 16 states. [2018-11-23 11:58:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,187 INFO L93 Difference]: Finished difference Result 126 states and 163 transitions. [2018-11-23 11:58:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:58:55,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-23 11:58:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2018-11-23 11:58:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2018-11-23 11:58:55,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 104 transitions. [2018-11-23 11:58:55,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,282 INFO L225 Difference]: With dead ends: 126 [2018-11-23 11:58:55,282 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:58:55,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:58:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-23 11:58:55,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:55,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 103 states. [2018-11-23 11:58:55,319 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 103 states. [2018-11-23 11:58:55,319 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 103 states. [2018-11-23 11:58:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,321 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2018-11-23 11:58:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2018-11-23 11:58:55,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,322 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 107 states. [2018-11-23 11:58:55,322 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 107 states. [2018-11-23 11:58:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,324 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2018-11-23 11:58:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2018-11-23 11:58:55,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:55,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 11:58:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-23 11:58:55,326 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 50 [2018-11-23 11:58:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:55,327 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-23 11:58:55,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:58:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-23 11:58:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:58:55,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:55,328 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:55,328 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:55,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash 215729184, now seen corresponding path program 13 times [2018-11-23 11:58:55,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:55,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {6263#true} call ULTIMATE.init(); {6263#true} is VALID [2018-11-23 11:58:55,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {6263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6263#true} is VALID [2018-11-23 11:58:55,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {6263#true} assume true; {6263#true} is VALID [2018-11-23 11:58:55,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6263#true} {6263#true} #77#return; {6263#true} is VALID [2018-11-23 11:58:55,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {6263#true} call #t~ret9 := main(); {6263#true} is VALID [2018-11-23 11:58:55,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {6263#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {6265#(= main_~i~0 0)} is VALID [2018-11-23 11:58:55,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {6265#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6265#(= main_~i~0 0)} is VALID [2018-11-23 11:58:55,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {6265#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6265#(= main_~i~0 0)} is VALID [2018-11-23 11:58:55,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {6265#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6266#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:55,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {6266#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6266#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:55,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {6266#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6266#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:55,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {6266#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6267#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:55,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {6267#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6267#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:55,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {6267#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6267#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:55,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {6267#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6268#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:55,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {6268#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6268#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:55,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {6268#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6268#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:55,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {6268#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6269#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:55,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {6269#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6269#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:55,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {6269#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6269#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:55,775 INFO L273 TraceCheckUtils]: 20: Hoare triple {6269#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6270#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:55,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {6270#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6270#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:55,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {6270#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6270#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:55,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {6270#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6271#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:55,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {6271#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6271#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:55,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {6271#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6271#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:55,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {6271#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6272#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:55,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {6272#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6272#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:55,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {6272#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6272#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:55,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {6272#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6273#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:55,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {6273#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6273#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:55,782 INFO L273 TraceCheckUtils]: 31: Hoare triple {6273#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6273#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:55,783 INFO L273 TraceCheckUtils]: 32: Hoare triple {6273#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6274#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:55,783 INFO L273 TraceCheckUtils]: 33: Hoare triple {6274#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6274#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:55,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {6274#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6274#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:55,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {6274#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6275#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:55,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {6275#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6275#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:55,786 INFO L273 TraceCheckUtils]: 37: Hoare triple {6275#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6275#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:55,787 INFO L273 TraceCheckUtils]: 38: Hoare triple {6275#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6276#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:55,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {6276#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6276#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:55,788 INFO L273 TraceCheckUtils]: 40: Hoare triple {6276#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6276#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:55,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {6276#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6277#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:55,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {6277#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6277#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:55,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {6277#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6277#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:55,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {6277#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6278#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:55,791 INFO L273 TraceCheckUtils]: 45: Hoare triple {6278#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6264#false} is VALID [2018-11-23 11:58:55,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {6264#false} havoc ~x~0; {6264#false} is VALID [2018-11-23 11:58:55,792 INFO L273 TraceCheckUtils]: 47: Hoare triple {6264#false} assume 0 != ~rv~0;~x~0 := 0; {6264#false} is VALID [2018-11-23 11:58:55,792 INFO L273 TraceCheckUtils]: 48: Hoare triple {6264#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6264#false} is VALID [2018-11-23 11:58:55,792 INFO L256 TraceCheckUtils]: 49: Hoare triple {6264#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {6264#false} is VALID [2018-11-23 11:58:55,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {6264#false} ~cond := #in~cond; {6264#false} is VALID [2018-11-23 11:58:55,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {6264#false} assume 0 == ~cond; {6264#false} is VALID [2018-11-23 11:58:55,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {6264#false} assume !false; {6264#false} is VALID [2018-11-23 11:58:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:55,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:55,795 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 11:58:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:56,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {6263#true} call ULTIMATE.init(); {6263#true} is VALID [2018-11-23 11:58:56,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {6263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6263#true} is VALID [2018-11-23 11:58:56,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {6263#true} assume true; {6263#true} is VALID [2018-11-23 11:58:56,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6263#true} {6263#true} #77#return; {6263#true} is VALID [2018-11-23 11:58:56,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {6263#true} call #t~ret9 := main(); {6263#true} is VALID [2018-11-23 11:58:56,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {6263#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {6297#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:56,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {6297#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6297#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:56,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {6297#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6297#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:56,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {6297#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6266#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:56,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {6266#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6266#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:56,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {6266#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6266#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:56,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {6266#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6267#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {6267#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6267#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {6267#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6267#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {6267#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6268#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {6268#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6268#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {6268#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6268#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {6268#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6269#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {6269#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6269#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {6269#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6269#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {6269#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6270#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {6270#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6270#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {6270#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6270#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {6270#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6271#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {6271#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6271#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {6271#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6271#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {6271#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6272#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {6272#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6272#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {6272#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6272#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,110 INFO L273 TraceCheckUtils]: 29: Hoare triple {6272#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6273#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,110 INFO L273 TraceCheckUtils]: 30: Hoare triple {6273#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6273#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,111 INFO L273 TraceCheckUtils]: 31: Hoare triple {6273#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6273#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,112 INFO L273 TraceCheckUtils]: 32: Hoare triple {6273#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6274#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {6274#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6274#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {6274#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6274#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {6274#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6275#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {6275#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6275#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,115 INFO L273 TraceCheckUtils]: 37: Hoare triple {6275#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6275#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {6275#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6276#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {6276#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6276#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {6276#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6276#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,119 INFO L273 TraceCheckUtils]: 41: Hoare triple {6276#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6277#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,119 INFO L273 TraceCheckUtils]: 42: Hoare triple {6277#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6277#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,120 INFO L273 TraceCheckUtils]: 43: Hoare triple {6277#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6277#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,121 INFO L273 TraceCheckUtils]: 44: Hoare triple {6277#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6278#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,121 INFO L273 TraceCheckUtils]: 45: Hoare triple {6278#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6264#false} is VALID [2018-11-23 11:58:56,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {6264#false} havoc ~x~0; {6264#false} is VALID [2018-11-23 11:58:56,122 INFO L273 TraceCheckUtils]: 47: Hoare triple {6264#false} assume 0 != ~rv~0;~x~0 := 0; {6264#false} is VALID [2018-11-23 11:58:56,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {6264#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6264#false} is VALID [2018-11-23 11:58:56,122 INFO L256 TraceCheckUtils]: 49: Hoare triple {6264#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {6264#false} is VALID [2018-11-23 11:58:56,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {6264#false} ~cond := #in~cond; {6264#false} is VALID [2018-11-23 11:58:56,123 INFO L273 TraceCheckUtils]: 51: Hoare triple {6264#false} assume 0 == ~cond; {6264#false} is VALID [2018-11-23 11:58:56,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {6264#false} assume !false; {6264#false} is VALID [2018-11-23 11:58:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:56,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:56,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:58:56,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-23 11:58:56,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:56,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:58:56,202 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 11:58:56,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:58:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:58:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:58:56,203 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 17 states. [2018-11-23 11:58:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,560 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2018-11-23 11:58:57,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:58:57,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-23 11:58:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:58:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2018-11-23 11:58:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:58:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2018-11-23 11:58:57,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 108 transitions. [2018-11-23 11:58:57,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:57,679 INFO L225 Difference]: With dead ends: 132 [2018-11-23 11:58:57,680 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:58:57,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:58:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:58:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-11-23 11:58:57,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:57,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 109 states. [2018-11-23 11:58:57,796 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 109 states. [2018-11-23 11:58:57,796 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 109 states. [2018-11-23 11:58:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,800 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2018-11-23 11:58:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2018-11-23 11:58:57,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:57,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:57,800 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 113 states. [2018-11-23 11:58:57,801 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 113 states. [2018-11-23 11:58:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,803 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2018-11-23 11:58:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2018-11-23 11:58:57,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:57,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:57,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:57,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:58:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 141 transitions. [2018-11-23 11:58:57,806 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 141 transitions. Word has length 53 [2018-11-23 11:58:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:57,807 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 141 transitions. [2018-11-23 11:58:57,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:58:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 141 transitions. [2018-11-23 11:58:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:58:57,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:57,808 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:57,808 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:57,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1630164704, now seen corresponding path program 14 times [2018-11-23 11:58:57,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:57,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {6986#true} call ULTIMATE.init(); {6986#true} is VALID [2018-11-23 11:58:58,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {6986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6986#true} is VALID [2018-11-23 11:58:58,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {6986#true} assume true; {6986#true} is VALID [2018-11-23 11:58:58,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6986#true} {6986#true} #77#return; {6986#true} is VALID [2018-11-23 11:58:58,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {6986#true} call #t~ret9 := main(); {6986#true} is VALID [2018-11-23 11:58:58,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {6986#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {6988#(= main_~i~0 0)} is VALID [2018-11-23 11:58:58,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {6988#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6988#(= main_~i~0 0)} is VALID [2018-11-23 11:58:58,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {6988#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6988#(= main_~i~0 0)} is VALID [2018-11-23 11:58:58,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {6988#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6989#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {6989#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6989#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {6989#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6989#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {6989#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6990#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {6990#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6990#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {6990#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6990#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {6990#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6991#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {6991#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6991#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {6991#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6991#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {6991#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6992#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {6992#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6992#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {6992#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6992#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {6992#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6993#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {6993#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6993#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {6993#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6993#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {6993#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6994#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {6994#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6994#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {6994#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6994#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {6994#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6995#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {6995#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6995#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {6995#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6995#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {6995#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6996#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {6996#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6996#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {6996#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6996#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {6996#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6997#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {6997#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6997#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {6997#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6997#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {6997#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6998#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {6998#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6998#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {6998#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6998#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {6998#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6999#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {6999#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6999#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,171 INFO L273 TraceCheckUtils]: 40: Hoare triple {6999#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6999#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,172 INFO L273 TraceCheckUtils]: 41: Hoare triple {6999#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7000#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,172 INFO L273 TraceCheckUtils]: 42: Hoare triple {7000#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7000#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {7000#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7000#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,174 INFO L273 TraceCheckUtils]: 44: Hoare triple {7000#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7001#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {7001#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7001#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,175 INFO L273 TraceCheckUtils]: 46: Hoare triple {7001#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7001#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {7001#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7002#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,176 INFO L273 TraceCheckUtils]: 48: Hoare triple {7002#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6987#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {6987#false} havoc ~x~0; {6987#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 50: Hoare triple {6987#false} assume 0 != ~rv~0;~x~0 := 0; {6987#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 51: Hoare triple {6987#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6987#false} is VALID [2018-11-23 11:58:58,177 INFO L256 TraceCheckUtils]: 52: Hoare triple {6987#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {6987#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {6987#false} ~cond := #in~cond; {6987#false} is VALID [2018-11-23 11:58:58,178 INFO L273 TraceCheckUtils]: 54: Hoare triple {6987#false} assume 0 == ~cond; {6987#false} is VALID [2018-11-23 11:58:58,178 INFO L273 TraceCheckUtils]: 55: Hoare triple {6987#false} assume !false; {6987#false} is VALID [2018-11-23 11:58:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:58,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:58:58,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:58,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:58,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:58,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {6986#true} call ULTIMATE.init(); {6986#true} is VALID [2018-11-23 11:58:58,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {6986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6986#true} is VALID [2018-11-23 11:58:58,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {6986#true} assume true; {6986#true} is VALID [2018-11-23 11:58:58,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6986#true} {6986#true} #77#return; {6986#true} is VALID [2018-11-23 11:58:58,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {6986#true} call #t~ret9 := main(); {6986#true} is VALID [2018-11-23 11:58:58,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {6986#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {7021#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {7021#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7021#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {7021#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7021#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {7021#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6989#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {6989#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6989#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {6989#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6989#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {6989#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6990#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {6990#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6990#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {6990#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6990#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:58,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {6990#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6991#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {6991#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6991#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {6991#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6991#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:58,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {6991#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6992#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {6992#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6992#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {6992#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6992#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:58,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {6992#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6993#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {6993#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6993#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {6993#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6993#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:58,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {6993#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6994#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {6994#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6994#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {6994#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6994#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:58,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {6994#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6995#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {6995#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6995#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {6995#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6995#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:58,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {6995#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6996#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {6996#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6996#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {6996#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6996#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:58,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {6996#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6997#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {6997#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6997#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {6997#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6997#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:58,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {6997#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6998#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {6998#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6998#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {6998#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6998#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:58,389 INFO L273 TraceCheckUtils]: 38: Hoare triple {6998#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {6999#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,390 INFO L273 TraceCheckUtils]: 39: Hoare triple {6999#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6999#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,390 INFO L273 TraceCheckUtils]: 40: Hoare triple {6999#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6999#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:58,391 INFO L273 TraceCheckUtils]: 41: Hoare triple {6999#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7000#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {7000#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7000#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {7000#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7000#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:58,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {7000#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7001#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,394 INFO L273 TraceCheckUtils]: 45: Hoare triple {7001#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7001#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,394 INFO L273 TraceCheckUtils]: 46: Hoare triple {7001#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7001#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:58,395 INFO L273 TraceCheckUtils]: 47: Hoare triple {7001#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7002#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:58,396 INFO L273 TraceCheckUtils]: 48: Hoare triple {7002#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6987#false} is VALID [2018-11-23 11:58:58,396 INFO L273 TraceCheckUtils]: 49: Hoare triple {6987#false} havoc ~x~0; {6987#false} is VALID [2018-11-23 11:58:58,396 INFO L273 TraceCheckUtils]: 50: Hoare triple {6987#false} assume 0 != ~rv~0;~x~0 := 0; {6987#false} is VALID [2018-11-23 11:58:58,396 INFO L273 TraceCheckUtils]: 51: Hoare triple {6987#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6987#false} is VALID [2018-11-23 11:58:58,396 INFO L256 TraceCheckUtils]: 52: Hoare triple {6987#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {6987#false} is VALID [2018-11-23 11:58:58,397 INFO L273 TraceCheckUtils]: 53: Hoare triple {6987#false} ~cond := #in~cond; {6987#false} is VALID [2018-11-23 11:58:58,397 INFO L273 TraceCheckUtils]: 54: Hoare triple {6987#false} assume 0 == ~cond; {6987#false} is VALID [2018-11-23 11:58:58,397 INFO L273 TraceCheckUtils]: 55: Hoare triple {6987#false} assume !false; {6987#false} is VALID [2018-11-23 11:58:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:58,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:58,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:58:58,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-23 11:58:58,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:58,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:58:58,478 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 11:58:58,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:58:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:58:58,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:58,480 INFO L87 Difference]: Start difference. First operand 109 states and 141 transitions. Second operand 18 states. [2018-11-23 11:58:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,206 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2018-11-23 11:58:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:58:59,206 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-23 11:58:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 11:58:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 11:58:59,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 112 transitions. [2018-11-23 11:58:59,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:59,310 INFO L225 Difference]: With dead ends: 138 [2018-11-23 11:58:59,311 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 11:58:59,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 11:58:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-11-23 11:58:59,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:59,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 115 states. [2018-11-23 11:58:59,354 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 115 states. [2018-11-23 11:58:59,354 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 115 states. [2018-11-23 11:58:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,357 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2018-11-23 11:58:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 155 transitions. [2018-11-23 11:58:59,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,358 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 119 states. [2018-11-23 11:58:59,358 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 119 states. [2018-11-23 11:58:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,360 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2018-11-23 11:58:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 155 transitions. [2018-11-23 11:58:59,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:59,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 11:58:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2018-11-23 11:58:59,363 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 56 [2018-11-23 11:58:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:59,363 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2018-11-23 11:58:59,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:58:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2018-11-23 11:58:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:58:59,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:59,364 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:59,365 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:59,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1154599968, now seen corresponding path program 15 times [2018-11-23 11:58:59,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:59,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {7747#true} call ULTIMATE.init(); {7747#true} is VALID [2018-11-23 11:59:00,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {7747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7747#true} is VALID [2018-11-23 11:59:00,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {7747#true} assume true; {7747#true} is VALID [2018-11-23 11:59:00,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7747#true} {7747#true} #77#return; {7747#true} is VALID [2018-11-23 11:59:00,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {7747#true} call #t~ret9 := main(); {7747#true} is VALID [2018-11-23 11:59:00,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {7747#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {7749#(= main_~i~0 0)} is VALID [2018-11-23 11:59:00,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {7749#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7749#(= main_~i~0 0)} is VALID [2018-11-23 11:59:00,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {7749#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7749#(= main_~i~0 0)} is VALID [2018-11-23 11:59:00,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {7749#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {7750#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7750#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {7750#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7750#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {7750#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {7751#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7751#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {7751#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7751#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {7751#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {7752#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7752#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {7752#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7752#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {7752#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {7753#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7753#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {7753#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7753#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {7753#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {7754#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7754#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {7754#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7754#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {7754#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {7755#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7755#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {7755#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7755#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {7755#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {7756#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7756#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {7756#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7756#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {7756#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {7757#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7757#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {7757#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7757#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {7757#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7758#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {7758#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7758#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {7758#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7758#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {7758#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7759#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {7759#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7759#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {7759#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7759#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {7759#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7760#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {7760#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7760#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {7760#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7760#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {7760#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7761#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {7761#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7761#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,378 INFO L273 TraceCheckUtils]: 43: Hoare triple {7761#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7761#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {7761#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7762#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {7762#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7762#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,381 INFO L273 TraceCheckUtils]: 46: Hoare triple {7762#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7762#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {7762#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7763#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,382 INFO L273 TraceCheckUtils]: 48: Hoare triple {7763#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7763#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,383 INFO L273 TraceCheckUtils]: 49: Hoare triple {7763#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7763#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:00,384 INFO L273 TraceCheckUtils]: 50: Hoare triple {7763#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7764#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:00,384 INFO L273 TraceCheckUtils]: 51: Hoare triple {7764#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7748#false} is VALID [2018-11-23 11:59:00,385 INFO L273 TraceCheckUtils]: 52: Hoare triple {7748#false} havoc ~x~0; {7748#false} is VALID [2018-11-23 11:59:00,385 INFO L273 TraceCheckUtils]: 53: Hoare triple {7748#false} assume 0 != ~rv~0;~x~0 := 0; {7748#false} is VALID [2018-11-23 11:59:00,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {7748#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7748#false} is VALID [2018-11-23 11:59:00,385 INFO L256 TraceCheckUtils]: 55: Hoare triple {7748#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {7748#false} is VALID [2018-11-23 11:59:00,386 INFO L273 TraceCheckUtils]: 56: Hoare triple {7748#false} ~cond := #in~cond; {7748#false} is VALID [2018-11-23 11:59:00,386 INFO L273 TraceCheckUtils]: 57: Hoare triple {7748#false} assume 0 == ~cond; {7748#false} is VALID [2018-11-23 11:59:00,386 INFO L273 TraceCheckUtils]: 58: Hoare triple {7748#false} assume !false; {7748#false} is VALID [2018-11-23 11:59:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:00,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:00,391 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 11:59:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:00,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 11:59:00,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:00,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {7747#true} call ULTIMATE.init(); {7747#true} is VALID [2018-11-23 11:59:00,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {7747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7747#true} is VALID [2018-11-23 11:59:00,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {7747#true} assume true; {7747#true} is VALID [2018-11-23 11:59:00,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7747#true} {7747#true} #77#return; {7747#true} is VALID [2018-11-23 11:59:00,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {7747#true} call #t~ret9 := main(); {7747#true} is VALID [2018-11-23 11:59:00,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {7747#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {7783#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:00,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {7783#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7783#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:00,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {7783#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7783#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:00,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {7783#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {7750#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7750#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {7750#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7750#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {7750#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {7751#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7751#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {7751#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7751#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {7751#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {7752#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7752#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {7752#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7752#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:00,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {7752#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {7753#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7753#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {7753#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7753#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:00,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {7753#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {7754#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7754#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {7754#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7754#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:00,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {7754#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {7755#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7755#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {7755#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7755#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:00,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {7755#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {7756#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7756#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {7756#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7756#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:00,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {7756#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,988 INFO L273 TraceCheckUtils]: 30: Hoare triple {7757#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7757#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {7757#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7757#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:00,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {7757#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7758#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {7758#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7758#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,991 INFO L273 TraceCheckUtils]: 34: Hoare triple {7758#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7758#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:00,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {7758#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7759#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {7759#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7759#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,993 INFO L273 TraceCheckUtils]: 37: Hoare triple {7759#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7759#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:00,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {7759#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7760#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {7760#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7760#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {7760#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7760#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:00,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {7760#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7761#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {7761#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7761#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {7761#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7761#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:00,998 INFO L273 TraceCheckUtils]: 44: Hoare triple {7761#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7762#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,999 INFO L273 TraceCheckUtils]: 45: Hoare triple {7762#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7762#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:00,999 INFO L273 TraceCheckUtils]: 46: Hoare triple {7762#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7762#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,000 INFO L273 TraceCheckUtils]: 47: Hoare triple {7762#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7763#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {7763#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7763#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,002 INFO L273 TraceCheckUtils]: 49: Hoare triple {7763#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7763#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {7763#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {7764#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {7764#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7748#false} is VALID [2018-11-23 11:59:01,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {7748#false} havoc ~x~0; {7748#false} is VALID [2018-11-23 11:59:01,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {7748#false} assume 0 != ~rv~0;~x~0 := 0; {7748#false} is VALID [2018-11-23 11:59:01,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {7748#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7748#false} is VALID [2018-11-23 11:59:01,005 INFO L256 TraceCheckUtils]: 55: Hoare triple {7748#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {7748#false} is VALID [2018-11-23 11:59:01,005 INFO L273 TraceCheckUtils]: 56: Hoare triple {7748#false} ~cond := #in~cond; {7748#false} is VALID [2018-11-23 11:59:01,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {7748#false} assume 0 == ~cond; {7748#false} is VALID [2018-11-23 11:59:01,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {7748#false} assume !false; {7748#false} is VALID [2018-11-23 11:59:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:01,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:01,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:59:01,030 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-23 11:59:01,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:59:01,102 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 11:59:01,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:59:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:59:01,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:59:01,103 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand 19 states. [2018-11-23 11:59:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,176 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2018-11-23 11:59:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:02,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-23 11:59:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:59:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2018-11-23 11:59:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:59:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2018-11-23 11:59:02,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 116 transitions. [2018-11-23 11:59:02,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,409 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:59:02,409 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:59:02,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:59:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:59:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-11-23 11:59:02,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 121 states. [2018-11-23 11:59:02,446 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 121 states. [2018-11-23 11:59:02,446 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 121 states. [2018-11-23 11:59:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,450 INFO L93 Difference]: Finished difference Result 125 states and 163 transitions. [2018-11-23 11:59:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2018-11-23 11:59:02,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,451 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 125 states. [2018-11-23 11:59:02,451 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 125 states. [2018-11-23 11:59:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,454 INFO L93 Difference]: Finished difference Result 125 states and 163 transitions. [2018-11-23 11:59:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2018-11-23 11:59:02,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 11:59:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 157 transitions. [2018-11-23 11:59:02,458 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 157 transitions. Word has length 59 [2018-11-23 11:59:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,458 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 157 transitions. [2018-11-23 11:59:02,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:59:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2018-11-23 11:59:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 11:59:02,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,459 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:02,459 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1592308000, now seen corresponding path program 16 times [2018-11-23 11:59:02,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {8546#true} call ULTIMATE.init(); {8546#true} is VALID [2018-11-23 11:59:03,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {8546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8546#true} is VALID [2018-11-23 11:59:03,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {8546#true} assume true; {8546#true} is VALID [2018-11-23 11:59:03,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8546#true} {8546#true} #77#return; {8546#true} is VALID [2018-11-23 11:59:03,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {8546#true} call #t~ret9 := main(); {8546#true} is VALID [2018-11-23 11:59:03,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {8546#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {8548#(= main_~i~0 0)} is VALID [2018-11-23 11:59:03,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {8548#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8548#(= main_~i~0 0)} is VALID [2018-11-23 11:59:03,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {8548#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8548#(= main_~i~0 0)} is VALID [2018-11-23 11:59:03,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {8548#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8549#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {8549#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8549#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {8549#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8549#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {8549#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8550#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {8550#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8550#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {8550#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8550#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {8550#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8551#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {8551#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8551#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {8551#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8551#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {8551#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8552#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {8552#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8552#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {8552#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8552#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {8552#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8553#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {8553#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8553#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {8553#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8553#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {8553#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8554#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {8554#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8554#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {8554#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8554#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {8554#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8555#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {8555#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8555#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {8555#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8555#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {8555#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8556#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {8556#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8556#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,260 INFO L273 TraceCheckUtils]: 31: Hoare triple {8556#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8556#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {8556#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8557#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {8557#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8557#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {8557#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8557#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {8557#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8558#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {8558#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8558#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {8558#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8558#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {8558#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8559#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {8559#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8559#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {8559#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8559#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,267 INFO L273 TraceCheckUtils]: 41: Hoare triple {8559#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8560#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {8560#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8560#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,268 INFO L273 TraceCheckUtils]: 43: Hoare triple {8560#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8560#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {8560#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8561#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,288 INFO L273 TraceCheckUtils]: 45: Hoare triple {8561#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8561#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,301 INFO L273 TraceCheckUtils]: 46: Hoare triple {8561#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8561#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {8561#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8562#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,310 INFO L273 TraceCheckUtils]: 48: Hoare triple {8562#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8562#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {8562#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8562#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,311 INFO L273 TraceCheckUtils]: 50: Hoare triple {8562#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8563#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {8563#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8563#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {8563#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8563#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,312 INFO L273 TraceCheckUtils]: 53: Hoare triple {8563#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8564#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,313 INFO L273 TraceCheckUtils]: 54: Hoare triple {8564#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8547#false} is VALID [2018-11-23 11:59:03,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {8547#false} havoc ~x~0; {8547#false} is VALID [2018-11-23 11:59:03,313 INFO L273 TraceCheckUtils]: 56: Hoare triple {8547#false} assume 0 != ~rv~0;~x~0 := 0; {8547#false} is VALID [2018-11-23 11:59:03,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {8547#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8547#false} is VALID [2018-11-23 11:59:03,313 INFO L256 TraceCheckUtils]: 58: Hoare triple {8547#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {8547#false} is VALID [2018-11-23 11:59:03,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {8547#false} ~cond := #in~cond; {8547#false} is VALID [2018-11-23 11:59:03,314 INFO L273 TraceCheckUtils]: 60: Hoare triple {8547#false} assume 0 == ~cond; {8547#false} is VALID [2018-11-23 11:59:03,314 INFO L273 TraceCheckUtils]: 61: Hoare triple {8547#false} assume !false; {8547#false} is VALID [2018-11-23 11:59:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:03,316 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 11:59:03,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:03,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:03,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:03,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {8546#true} call ULTIMATE.init(); {8546#true} is VALID [2018-11-23 11:59:03,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {8546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8546#true} is VALID [2018-11-23 11:59:03,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {8546#true} assume true; {8546#true} is VALID [2018-11-23 11:59:03,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8546#true} {8546#true} #77#return; {8546#true} is VALID [2018-11-23 11:59:03,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {8546#true} call #t~ret9 := main(); {8546#true} is VALID [2018-11-23 11:59:03,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {8546#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {8583#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {8583#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8583#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {8583#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8583#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {8583#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8549#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {8549#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8549#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {8549#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8549#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {8549#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8550#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {8550#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8550#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {8550#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8550#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {8550#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8551#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {8551#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8551#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {8551#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8551#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {8551#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8552#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {8552#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8552#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {8552#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8552#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {8552#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8553#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {8553#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8553#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {8553#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8553#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:03,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {8553#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8554#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {8554#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8554#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {8554#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8554#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:03,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {8554#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8555#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {8555#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8555#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {8555#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8555#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:03,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {8555#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8556#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {8556#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8556#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {8556#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8556#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:03,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {8556#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8557#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {8557#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8557#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {8557#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8557#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:03,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {8557#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8558#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {8558#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8558#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {8558#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8558#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:03,638 INFO L273 TraceCheckUtils]: 38: Hoare triple {8558#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8559#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {8559#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8559#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,639 INFO L273 TraceCheckUtils]: 40: Hoare triple {8559#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8559#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:03,640 INFO L273 TraceCheckUtils]: 41: Hoare triple {8559#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8560#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {8560#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8560#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {8560#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8560#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:03,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {8560#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8561#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {8561#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8561#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {8561#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8561#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:03,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {8561#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8562#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {8562#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8562#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {8562#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8562#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:03,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {8562#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8563#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {8563#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8563#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {8563#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8563#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:03,648 INFO L273 TraceCheckUtils]: 53: Hoare triple {8563#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {8564#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:03,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {8564#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8547#false} is VALID [2018-11-23 11:59:03,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {8547#false} havoc ~x~0; {8547#false} is VALID [2018-11-23 11:59:03,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {8547#false} assume 0 != ~rv~0;~x~0 := 0; {8547#false} is VALID [2018-11-23 11:59:03,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {8547#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8547#false} is VALID [2018-11-23 11:59:03,649 INFO L256 TraceCheckUtils]: 58: Hoare triple {8547#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {8547#false} is VALID [2018-11-23 11:59:03,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {8547#false} ~cond := #in~cond; {8547#false} is VALID [2018-11-23 11:59:03,650 INFO L273 TraceCheckUtils]: 60: Hoare triple {8547#false} assume 0 == ~cond; {8547#false} is VALID [2018-11-23 11:59:03,650 INFO L273 TraceCheckUtils]: 61: Hoare triple {8547#false} assume !false; {8547#false} is VALID [2018-11-23 11:59:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:03,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:03,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:59:03,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-23 11:59:03,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:59:03,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:59:03,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:59:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:03,739 INFO L87 Difference]: Start difference. First operand 121 states and 157 transitions. Second operand 20 states. [2018-11-23 11:59:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,221 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2018-11-23 11:59:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:59:04,222 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-23 11:59:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2018-11-23 11:59:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2018-11-23 11:59:04,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 120 transitions. [2018-11-23 11:59:04,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,407 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:59:04,407 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 11:59:04,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 11:59:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-23 11:59:04,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 127 states. [2018-11-23 11:59:04,448 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 127 states. [2018-11-23 11:59:04,448 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 127 states. [2018-11-23 11:59:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,451 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2018-11-23 11:59:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2018-11-23 11:59:04,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,452 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 131 states. [2018-11-23 11:59:04,452 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 131 states. [2018-11-23 11:59:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,455 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2018-11-23 11:59:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2018-11-23 11:59:04,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 11:59:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2018-11-23 11:59:04,458 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 165 transitions. Word has length 62 [2018-11-23 11:59:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,459 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 165 transitions. [2018-11-23 11:59:04,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:59:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2018-11-23 11:59:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:59:04,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,460 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:04,460 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1579275296, now seen corresponding path program 17 times [2018-11-23 11:59:04,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:04,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {9383#true} call ULTIMATE.init(); {9383#true} is VALID [2018-11-23 11:59:04,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {9383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9383#true} is VALID [2018-11-23 11:59:04,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {9383#true} assume true; {9383#true} is VALID [2018-11-23 11:59:04,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9383#true} {9383#true} #77#return; {9383#true} is VALID [2018-11-23 11:59:04,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {9383#true} call #t~ret9 := main(); {9383#true} is VALID [2018-11-23 11:59:04,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {9383#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {9385#(= main_~i~0 0)} is VALID [2018-11-23 11:59:04,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {9385#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9385#(= main_~i~0 0)} is VALID [2018-11-23 11:59:04,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {9385#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9385#(= main_~i~0 0)} is VALID [2018-11-23 11:59:04,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {9385#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9386#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:04,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {9386#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9386#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:04,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {9386#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9386#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:04,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {9386#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9387#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {9387#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9387#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {9387#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9387#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {9387#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9388#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:04,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {9388#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9388#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:04,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {9388#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9388#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:04,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {9388#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9389#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:04,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {9389#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9389#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:04,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {9389#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9389#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:04,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {9389#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9390#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:04,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {9390#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9390#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:04,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {9390#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9390#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:04,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {9390#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9391#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:04,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {9391#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9391#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:04,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {9391#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9391#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:04,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {9391#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9392#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:04,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {9392#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9392#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:04,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {9392#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9392#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:04,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {9392#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9393#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:04,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {9393#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9393#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:04,767 INFO L273 TraceCheckUtils]: 31: Hoare triple {9393#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9393#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:04,768 INFO L273 TraceCheckUtils]: 32: Hoare triple {9393#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9394#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:04,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {9394#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9394#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:04,789 INFO L273 TraceCheckUtils]: 34: Hoare triple {9394#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9394#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:04,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {9394#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9395#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:04,790 INFO L273 TraceCheckUtils]: 36: Hoare triple {9395#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9395#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:04,790 INFO L273 TraceCheckUtils]: 37: Hoare triple {9395#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9395#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:04,791 INFO L273 TraceCheckUtils]: 38: Hoare triple {9395#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9396#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:04,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {9396#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9396#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:04,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {9396#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9396#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:04,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {9396#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9397#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:04,793 INFO L273 TraceCheckUtils]: 42: Hoare triple {9397#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9397#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:04,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {9397#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9397#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:04,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {9397#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9398#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:04,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {9398#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9398#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:04,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {9398#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9398#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:04,796 INFO L273 TraceCheckUtils]: 47: Hoare triple {9398#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9399#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:04,797 INFO L273 TraceCheckUtils]: 48: Hoare triple {9399#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9399#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:04,797 INFO L273 TraceCheckUtils]: 49: Hoare triple {9399#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9399#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:04,798 INFO L273 TraceCheckUtils]: 50: Hoare triple {9399#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9400#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:04,799 INFO L273 TraceCheckUtils]: 51: Hoare triple {9400#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9400#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:04,799 INFO L273 TraceCheckUtils]: 52: Hoare triple {9400#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9400#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:04,800 INFO L273 TraceCheckUtils]: 53: Hoare triple {9400#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9401#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:04,801 INFO L273 TraceCheckUtils]: 54: Hoare triple {9401#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9401#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:04,801 INFO L273 TraceCheckUtils]: 55: Hoare triple {9401#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9401#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:04,802 INFO L273 TraceCheckUtils]: 56: Hoare triple {9401#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9402#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:04,803 INFO L273 TraceCheckUtils]: 57: Hoare triple {9402#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9384#false} is VALID [2018-11-23 11:59:04,803 INFO L273 TraceCheckUtils]: 58: Hoare triple {9384#false} havoc ~x~0; {9384#false} is VALID [2018-11-23 11:59:04,803 INFO L273 TraceCheckUtils]: 59: Hoare triple {9384#false} assume 0 != ~rv~0;~x~0 := 0; {9384#false} is VALID [2018-11-23 11:59:04,803 INFO L273 TraceCheckUtils]: 60: Hoare triple {9384#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9384#false} is VALID [2018-11-23 11:59:04,804 INFO L256 TraceCheckUtils]: 61: Hoare triple {9384#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {9384#false} is VALID [2018-11-23 11:59:04,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {9384#false} ~cond := #in~cond; {9384#false} is VALID [2018-11-23 11:59:04,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {9384#false} assume 0 == ~cond; {9384#false} is VALID [2018-11-23 11:59:04,804 INFO L273 TraceCheckUtils]: 64: Hoare triple {9384#false} assume !false; {9384#false} is VALID [2018-11-23 11:59:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:04,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,808 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 11:59:04,817 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:05,009 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:59:05,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {9383#true} call ULTIMATE.init(); {9383#true} is VALID [2018-11-23 11:59:05,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {9383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9383#true} is VALID [2018-11-23 11:59:05,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {9383#true} assume true; {9383#true} is VALID [2018-11-23 11:59:05,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9383#true} {9383#true} #77#return; {9383#true} is VALID [2018-11-23 11:59:05,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {9383#true} call #t~ret9 := main(); {9383#true} is VALID [2018-11-23 11:59:05,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {9383#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {9421#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:05,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {9421#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9421#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:05,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {9421#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9421#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:05,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {9421#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9386#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {9386#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9386#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {9386#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9386#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {9386#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9387#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {9387#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9387#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {9387#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9387#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {9387#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9388#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {9388#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9388#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {9388#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9388#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {9388#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9389#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {9389#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9389#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {9389#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9389#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {9389#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9390#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {9390#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9390#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {9390#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9390#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {9390#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9391#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {9391#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9391#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {9391#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9391#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {9391#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9392#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {9392#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9392#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {9392#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9392#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {9392#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9393#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {9393#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9393#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {9393#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9393#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {9393#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9394#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {9394#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9394#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {9394#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9394#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {9394#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9395#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {9395#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9395#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {9395#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9395#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {9395#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9396#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {9396#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9396#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {9396#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9396#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {9396#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9397#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {9397#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9397#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {9397#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9397#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {9397#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9398#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {9398#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9398#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {9398#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9398#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {9398#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9399#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {9399#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9399#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,313 INFO L273 TraceCheckUtils]: 49: Hoare triple {9399#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9399#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {9399#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9400#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,315 INFO L273 TraceCheckUtils]: 51: Hoare triple {9400#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9400#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,315 INFO L273 TraceCheckUtils]: 52: Hoare triple {9400#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9400#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {9400#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9401#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {9401#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9401#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {9401#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9401#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {9401#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {9402#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,319 INFO L273 TraceCheckUtils]: 57: Hoare triple {9402#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9384#false} is VALID [2018-11-23 11:59:05,319 INFO L273 TraceCheckUtils]: 58: Hoare triple {9384#false} havoc ~x~0; {9384#false} is VALID [2018-11-23 11:59:05,319 INFO L273 TraceCheckUtils]: 59: Hoare triple {9384#false} assume 0 != ~rv~0;~x~0 := 0; {9384#false} is VALID [2018-11-23 11:59:05,319 INFO L273 TraceCheckUtils]: 60: Hoare triple {9384#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9384#false} is VALID [2018-11-23 11:59:05,320 INFO L256 TraceCheckUtils]: 61: Hoare triple {9384#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {9384#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {9384#false} ~cond := #in~cond; {9384#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {9384#false} assume 0 == ~cond; {9384#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {9384#false} assume !false; {9384#false} is VALID [2018-11-23 11:59:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:05,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:59:05,343 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-23 11:59:05,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:59:05,412 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 11:59:05,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:59:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:59:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:59:05,414 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand 21 states. [2018-11-23 11:59:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,985 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 11:59:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:05,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-23 11:59:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:59:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-23 11:59:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:59:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-23 11:59:05,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 124 transitions. [2018-11-23 11:59:06,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,101 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:59:06,102 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 11:59:06,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:59:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 11:59:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-11-23 11:59:06,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 133 states. [2018-11-23 11:59:06,295 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 133 states. [2018-11-23 11:59:06,295 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 133 states. [2018-11-23 11:59:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,298 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2018-11-23 11:59:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-11-23 11:59:06,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,299 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 137 states. [2018-11-23 11:59:06,300 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 137 states. [2018-11-23 11:59:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,302 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2018-11-23 11:59:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-11-23 11:59:06,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 11:59:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2018-11-23 11:59:06,306 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 65 [2018-11-23 11:59:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,306 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2018-11-23 11:59:06,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:59:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2018-11-23 11:59:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 11:59:06,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,307 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:06,308 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1231701728, now seen corresponding path program 18 times [2018-11-23 11:59:06,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {10258#true} call ULTIMATE.init(); {10258#true} is VALID [2018-11-23 11:59:06,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {10258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10258#true} is VALID [2018-11-23 11:59:06,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {10258#true} assume true; {10258#true} is VALID [2018-11-23 11:59:06,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10258#true} {10258#true} #77#return; {10258#true} is VALID [2018-11-23 11:59:06,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {10258#true} call #t~ret9 := main(); {10258#true} is VALID [2018-11-23 11:59:06,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {10258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {10260#(= main_~i~0 0)} is VALID [2018-11-23 11:59:06,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {10260#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10260#(= main_~i~0 0)} is VALID [2018-11-23 11:59:06,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {10260#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10260#(= main_~i~0 0)} is VALID [2018-11-23 11:59:06,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {10260#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10261#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {10261#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10261#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {10261#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10261#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {10261#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10262#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:06,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {10262#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10262#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:06,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {10262#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10262#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:06,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {10262#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10263#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:06,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {10263#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10263#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:06,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {10263#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10263#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:06,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {10263#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10264#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:06,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {10264#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10264#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:06,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {10264#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10264#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:06,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {10264#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10265#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:06,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {10265#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10265#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:06,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {10265#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10265#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:06,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {10265#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10266#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:06,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {10266#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10266#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:06,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {10266#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10266#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:06,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {10266#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10267#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:06,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {10267#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10267#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:06,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {10267#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10267#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:06,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {10267#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10268#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:06,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {10268#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10268#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:06,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {10268#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10268#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:06,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {10268#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10269#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:06,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {10269#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10269#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:06,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {10269#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10269#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:06,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {10269#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10270#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:06,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {10270#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10270#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:06,916 INFO L273 TraceCheckUtils]: 37: Hoare triple {10270#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10270#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:06,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {10270#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10271#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:06,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {10271#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10271#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:06,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {10271#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10271#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:06,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {10271#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10272#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:06,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {10272#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10272#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:06,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {10272#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10272#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:06,921 INFO L273 TraceCheckUtils]: 44: Hoare triple {10272#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10273#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:06,922 INFO L273 TraceCheckUtils]: 45: Hoare triple {10273#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10273#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:06,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {10273#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10273#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:06,923 INFO L273 TraceCheckUtils]: 47: Hoare triple {10273#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10274#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:06,923 INFO L273 TraceCheckUtils]: 48: Hoare triple {10274#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10274#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:06,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {10274#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10274#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:06,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {10274#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10275#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:06,942 INFO L273 TraceCheckUtils]: 51: Hoare triple {10275#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10275#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:06,948 INFO L273 TraceCheckUtils]: 52: Hoare triple {10275#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10275#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:06,949 INFO L273 TraceCheckUtils]: 53: Hoare triple {10275#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10276#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:06,949 INFO L273 TraceCheckUtils]: 54: Hoare triple {10276#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10276#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:06,949 INFO L273 TraceCheckUtils]: 55: Hoare triple {10276#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10276#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:06,950 INFO L273 TraceCheckUtils]: 56: Hoare triple {10276#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10277#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:06,950 INFO L273 TraceCheckUtils]: 57: Hoare triple {10277#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10277#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:06,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {10277#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10277#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:06,951 INFO L273 TraceCheckUtils]: 59: Hoare triple {10277#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10278#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:06,952 INFO L273 TraceCheckUtils]: 60: Hoare triple {10278#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10259#false} is VALID [2018-11-23 11:59:06,952 INFO L273 TraceCheckUtils]: 61: Hoare triple {10259#false} havoc ~x~0; {10259#false} is VALID [2018-11-23 11:59:06,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {10259#false} assume 0 != ~rv~0;~x~0 := 0; {10259#false} is VALID [2018-11-23 11:59:06,952 INFO L273 TraceCheckUtils]: 63: Hoare triple {10259#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10259#false} is VALID [2018-11-23 11:59:06,953 INFO L256 TraceCheckUtils]: 64: Hoare triple {10259#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {10259#false} is VALID [2018-11-23 11:59:06,953 INFO L273 TraceCheckUtils]: 65: Hoare triple {10259#false} ~cond := #in~cond; {10259#false} is VALID [2018-11-23 11:59:06,953 INFO L273 TraceCheckUtils]: 66: Hoare triple {10259#false} assume 0 == ~cond; {10259#false} is VALID [2018-11-23 11:59:06,953 INFO L273 TraceCheckUtils]: 67: Hoare triple {10259#false} assume !false; {10259#false} is VALID [2018-11-23 11:59:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:06,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:06,958 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 11:59:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:07,567 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 11:59:07,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {10258#true} call ULTIMATE.init(); {10258#true} is VALID [2018-11-23 11:59:07,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {10258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10258#true} is VALID [2018-11-23 11:59:07,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {10258#true} assume true; {10258#true} is VALID [2018-11-23 11:59:07,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10258#true} {10258#true} #77#return; {10258#true} is VALID [2018-11-23 11:59:07,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {10258#true} call #t~ret9 := main(); {10258#true} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {10258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {10297#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {10297#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10297#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {10297#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10297#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {10297#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10261#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {10261#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10261#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {10261#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10261#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {10261#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10262#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {10262#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10262#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {10262#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10262#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {10262#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10263#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {10263#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10263#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {10263#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10263#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {10263#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10264#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {10264#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10264#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {10264#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10264#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {10264#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10265#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {10265#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10265#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {10265#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10265#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {10265#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10266#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {10266#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10266#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {10266#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10266#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {10266#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10267#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {10267#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10267#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {10267#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10267#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {10267#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10268#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {10268#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10268#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {10268#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10268#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {10268#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10269#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {10269#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10269#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {10269#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10269#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {10269#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10270#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {10270#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10270#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {10270#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10270#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {10270#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10271#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {10271#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10271#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {10271#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10271#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {10271#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10272#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,763 INFO L273 TraceCheckUtils]: 42: Hoare triple {10272#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10272#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {10272#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10272#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,764 INFO L273 TraceCheckUtils]: 44: Hoare triple {10272#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10273#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,765 INFO L273 TraceCheckUtils]: 45: Hoare triple {10273#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10273#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,765 INFO L273 TraceCheckUtils]: 46: Hoare triple {10273#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10273#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,766 INFO L273 TraceCheckUtils]: 47: Hoare triple {10273#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10274#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,767 INFO L273 TraceCheckUtils]: 48: Hoare triple {10274#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10274#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,767 INFO L273 TraceCheckUtils]: 49: Hoare triple {10274#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10274#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {10274#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10275#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {10275#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10275#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {10275#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10275#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {10275#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10276#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {10276#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10276#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {10276#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10276#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {10276#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10277#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,773 INFO L273 TraceCheckUtils]: 57: Hoare triple {10277#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10277#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,773 INFO L273 TraceCheckUtils]: 58: Hoare triple {10277#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {10277#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {10277#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {10278#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {10278#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10259#false} is VALID [2018-11-23 11:59:07,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {10259#false} havoc ~x~0; {10259#false} is VALID [2018-11-23 11:59:07,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {10259#false} assume 0 != ~rv~0;~x~0 := 0; {10259#false} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {10259#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10259#false} is VALID [2018-11-23 11:59:07,776 INFO L256 TraceCheckUtils]: 64: Hoare triple {10259#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {10259#false} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {10259#false} ~cond := #in~cond; {10259#false} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {10259#false} assume 0 == ~cond; {10259#false} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 67: Hoare triple {10259#false} assume !false; {10259#false} is VALID [2018-11-23 11:59:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:07,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:59:07,801 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-23 11:59:07,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:59:07,907 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 11:59:07,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:59:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:59:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:59:07,908 INFO L87 Difference]: Start difference. First operand 133 states and 173 transitions. Second operand 22 states. [2018-11-23 11:59:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,436 INFO L93 Difference]: Finished difference Result 162 states and 211 transitions. [2018-11-23 11:59:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:59:08,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-23 11:59:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:59:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 128 transitions. [2018-11-23 11:59:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:59:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 128 transitions. [2018-11-23 11:59:08,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 128 transitions. [2018-11-23 11:59:08,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:08,555 INFO L225 Difference]: With dead ends: 162 [2018-11-23 11:59:08,555 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 11:59:08,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:59:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 11:59:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-11-23 11:59:08,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 139 states. [2018-11-23 11:59:08,656 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 139 states. [2018-11-23 11:59:08,656 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 139 states. [2018-11-23 11:59:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,660 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-11-23 11:59:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2018-11-23 11:59:08,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,662 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 143 states. [2018-11-23 11:59:08,662 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 143 states. [2018-11-23 11:59:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,664 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-11-23 11:59:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2018-11-23 11:59:08,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 11:59:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2018-11-23 11:59:08,667 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 68 [2018-11-23 11:59:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,667 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2018-11-23 11:59:08,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:59:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2018-11-23 11:59:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:59:08,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,668 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:08,669 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1833688096, now seen corresponding path program 19 times [2018-11-23 11:59:08,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {11171#true} call ULTIMATE.init(); {11171#true} is VALID [2018-11-23 11:59:09,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {11171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11171#true} is VALID [2018-11-23 11:59:09,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {11171#true} assume true; {11171#true} is VALID [2018-11-23 11:59:09,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11171#true} {11171#true} #77#return; {11171#true} is VALID [2018-11-23 11:59:09,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {11171#true} call #t~ret9 := main(); {11171#true} is VALID [2018-11-23 11:59:09,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {11171#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {11173#(= main_~i~0 0)} is VALID [2018-11-23 11:59:09,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {11173#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11173#(= main_~i~0 0)} is VALID [2018-11-23 11:59:09,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {11173#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11173#(= main_~i~0 0)} is VALID [2018-11-23 11:59:09,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {11173#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11174#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {11174#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11174#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {11174#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11174#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {11174#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11175#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {11175#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11175#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {11175#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11175#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {11175#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11176#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {11176#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11176#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {11176#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11176#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {11176#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11177#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {11177#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11177#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {11177#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11177#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {11177#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11178#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {11178#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11178#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {11178#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11178#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {11178#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11179#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {11179#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11179#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {11179#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11179#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {11179#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11180#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {11180#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11180#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {11180#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11180#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11181#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {11181#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11181#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {11181#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11181#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {11181#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11182#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {11182#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11182#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {11182#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11182#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {11182#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11183#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {11183#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11183#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {11183#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11183#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,428 INFO L273 TraceCheckUtils]: 38: Hoare triple {11183#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11184#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {11184#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11184#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,429 INFO L273 TraceCheckUtils]: 40: Hoare triple {11184#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11184#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,430 INFO L273 TraceCheckUtils]: 41: Hoare triple {11184#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11185#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,430 INFO L273 TraceCheckUtils]: 42: Hoare triple {11185#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11185#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,431 INFO L273 TraceCheckUtils]: 43: Hoare triple {11185#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11185#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,432 INFO L273 TraceCheckUtils]: 44: Hoare triple {11185#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11186#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,432 INFO L273 TraceCheckUtils]: 45: Hoare triple {11186#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11186#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {11186#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11186#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {11186#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11187#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {11187#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11187#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {11187#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11187#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,436 INFO L273 TraceCheckUtils]: 50: Hoare triple {11187#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11188#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,436 INFO L273 TraceCheckUtils]: 51: Hoare triple {11188#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11188#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,437 INFO L273 TraceCheckUtils]: 52: Hoare triple {11188#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11188#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,438 INFO L273 TraceCheckUtils]: 53: Hoare triple {11188#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11189#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,438 INFO L273 TraceCheckUtils]: 54: Hoare triple {11189#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11189#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,439 INFO L273 TraceCheckUtils]: 55: Hoare triple {11189#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11189#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,440 INFO L273 TraceCheckUtils]: 56: Hoare triple {11189#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11190#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,440 INFO L273 TraceCheckUtils]: 57: Hoare triple {11190#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11190#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,441 INFO L273 TraceCheckUtils]: 58: Hoare triple {11190#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11190#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,442 INFO L273 TraceCheckUtils]: 59: Hoare triple {11190#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11191#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,442 INFO L273 TraceCheckUtils]: 60: Hoare triple {11191#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11191#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {11191#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11191#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,444 INFO L273 TraceCheckUtils]: 62: Hoare triple {11191#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11192#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,444 INFO L273 TraceCheckUtils]: 63: Hoare triple {11192#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11172#false} is VALID [2018-11-23 11:59:09,445 INFO L273 TraceCheckUtils]: 64: Hoare triple {11172#false} havoc ~x~0; {11172#false} is VALID [2018-11-23 11:59:09,445 INFO L273 TraceCheckUtils]: 65: Hoare triple {11172#false} assume 0 != ~rv~0;~x~0 := 0; {11172#false} is VALID [2018-11-23 11:59:09,445 INFO L273 TraceCheckUtils]: 66: Hoare triple {11172#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11172#false} is VALID [2018-11-23 11:59:09,445 INFO L256 TraceCheckUtils]: 67: Hoare triple {11172#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {11172#false} is VALID [2018-11-23 11:59:09,445 INFO L273 TraceCheckUtils]: 68: Hoare triple {11172#false} ~cond := #in~cond; {11172#false} is VALID [2018-11-23 11:59:09,446 INFO L273 TraceCheckUtils]: 69: Hoare triple {11172#false} assume 0 == ~cond; {11172#false} is VALID [2018-11-23 11:59:09,446 INFO L273 TraceCheckUtils]: 70: Hoare triple {11172#false} assume !false; {11172#false} is VALID [2018-11-23 11:59:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:09,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,450 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 11:59:09,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:09,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {11171#true} call ULTIMATE.init(); {11171#true} is VALID [2018-11-23 11:59:09,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {11171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11171#true} is VALID [2018-11-23 11:59:09,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {11171#true} assume true; {11171#true} is VALID [2018-11-23 11:59:09,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11171#true} {11171#true} #77#return; {11171#true} is VALID [2018-11-23 11:59:09,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {11171#true} call #t~ret9 := main(); {11171#true} is VALID [2018-11-23 11:59:09,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {11171#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {11211#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {11211#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11211#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {11211#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11211#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {11211#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11174#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {11174#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11174#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {11174#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11174#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {11174#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11175#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {11175#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11175#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {11175#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11175#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {11175#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11176#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {11176#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11176#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {11176#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11176#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {11176#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11177#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {11177#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11177#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {11177#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11177#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {11177#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11178#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {11178#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11178#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {11178#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11178#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {11178#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11179#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {11179#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11179#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {11179#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11179#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {11179#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11180#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {11180#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11180#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {11180#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11180#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11181#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {11181#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11181#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {11181#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11181#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {11181#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11182#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {11182#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11182#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {11182#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11182#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {11182#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11183#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {11183#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11183#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {11183#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11183#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,767 INFO L273 TraceCheckUtils]: 38: Hoare triple {11183#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11184#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {11184#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11184#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,768 INFO L273 TraceCheckUtils]: 40: Hoare triple {11184#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11184#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {11184#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11185#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {11185#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11185#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,770 INFO L273 TraceCheckUtils]: 43: Hoare triple {11185#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11185#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {11185#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11186#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {11186#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11186#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {11186#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11186#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,773 INFO L273 TraceCheckUtils]: 47: Hoare triple {11186#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11187#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {11187#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11187#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {11187#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11187#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {11187#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11188#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,776 INFO L273 TraceCheckUtils]: 51: Hoare triple {11188#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11188#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,776 INFO L273 TraceCheckUtils]: 52: Hoare triple {11188#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11188#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {11188#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11189#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,778 INFO L273 TraceCheckUtils]: 54: Hoare triple {11189#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11189#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,778 INFO L273 TraceCheckUtils]: 55: Hoare triple {11189#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11189#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,779 INFO L273 TraceCheckUtils]: 56: Hoare triple {11189#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11190#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,780 INFO L273 TraceCheckUtils]: 57: Hoare triple {11190#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11190#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,780 INFO L273 TraceCheckUtils]: 58: Hoare triple {11190#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11190#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {11190#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11191#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {11191#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11191#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {11191#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {11191#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {11191#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {11192#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,784 INFO L273 TraceCheckUtils]: 63: Hoare triple {11192#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11172#false} is VALID [2018-11-23 11:59:09,784 INFO L273 TraceCheckUtils]: 64: Hoare triple {11172#false} havoc ~x~0; {11172#false} is VALID [2018-11-23 11:59:09,784 INFO L273 TraceCheckUtils]: 65: Hoare triple {11172#false} assume 0 != ~rv~0;~x~0 := 0; {11172#false} is VALID [2018-11-23 11:59:09,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {11172#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11172#false} is VALID [2018-11-23 11:59:09,785 INFO L256 TraceCheckUtils]: 67: Hoare triple {11172#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {11172#false} is VALID [2018-11-23 11:59:09,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {11172#false} ~cond := #in~cond; {11172#false} is VALID [2018-11-23 11:59:09,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {11172#false} assume 0 == ~cond; {11172#false} is VALID [2018-11-23 11:59:09,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {11172#false} assume !false; {11172#false} is VALID [2018-11-23 11:59:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:09,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:09,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:59:09,810 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-23 11:59:09,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:09,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:59:09,886 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 11:59:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:59:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:59:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:09,888 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand 23 states. [2018-11-23 11:59:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,429 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2018-11-23 11:59:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:59:10,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-23 11:59:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2018-11-23 11:59:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2018-11-23 11:59:10,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 132 transitions. [2018-11-23 11:59:10,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:10,554 INFO L225 Difference]: With dead ends: 168 [2018-11-23 11:59:10,554 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:59:10,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:59:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-11-23 11:59:10,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:10,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 145 states. [2018-11-23 11:59:10,645 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 145 states. [2018-11-23 11:59:10,645 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 145 states. [2018-11-23 11:59:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,648 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2018-11-23 11:59:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 195 transitions. [2018-11-23 11:59:10,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:10,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:10,648 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 149 states. [2018-11-23 11:59:10,649 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 149 states. [2018-11-23 11:59:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,651 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2018-11-23 11:59:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 195 transitions. [2018-11-23 11:59:10,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:10,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:10,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:10,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 11:59:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2018-11-23 11:59:10,655 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 71 [2018-11-23 11:59:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:10,655 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2018-11-23 11:59:10,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:59:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 11:59:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 11:59:10,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:10,657 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:10,657 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:10,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash -173850912, now seen corresponding path program 20 times [2018-11-23 11:59:10,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:10,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:10,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {12122#true} call ULTIMATE.init(); {12122#true} is VALID [2018-11-23 11:59:11,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {12122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12122#true} is VALID [2018-11-23 11:59:11,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {12122#true} assume true; {12122#true} is VALID [2018-11-23 11:59:11,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12122#true} {12122#true} #77#return; {12122#true} is VALID [2018-11-23 11:59:11,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {12122#true} call #t~ret9 := main(); {12122#true} is VALID [2018-11-23 11:59:11,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {12122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {12124#(= main_~i~0 0)} is VALID [2018-11-23 11:59:11,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {12124#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12124#(= main_~i~0 0)} is VALID [2018-11-23 11:59:11,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {12124#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12124#(= main_~i~0 0)} is VALID [2018-11-23 11:59:11,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {12124#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12125#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {12125#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12125#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {12125#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12125#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {12125#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12126#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {12126#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12126#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {12126#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12126#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {12126#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12127#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {12127#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12127#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {12127#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12127#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {12127#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12128#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:11,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {12128#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12128#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:11,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {12128#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12128#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:11,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {12128#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12129#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:11,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {12129#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12129#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:11,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {12129#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12129#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:11,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {12129#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12130#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:11,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {12130#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12130#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:11,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {12130#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12130#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:11,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {12130#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12131#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:11,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {12131#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12131#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:11,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {12131#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12131#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:11,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {12131#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12132#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:11,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {12132#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12132#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:11,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {12132#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12132#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:11,187 INFO L273 TraceCheckUtils]: 32: Hoare triple {12132#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12133#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:11,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {12133#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12133#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:11,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {12133#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12133#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:11,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {12133#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12134#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:11,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {12134#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12134#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:11,189 INFO L273 TraceCheckUtils]: 37: Hoare triple {12134#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12134#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:11,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {12134#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12135#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:11,191 INFO L273 TraceCheckUtils]: 39: Hoare triple {12135#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12135#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:11,191 INFO L273 TraceCheckUtils]: 40: Hoare triple {12135#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12135#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:11,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {12135#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12136#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:11,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {12136#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12136#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:11,193 INFO L273 TraceCheckUtils]: 43: Hoare triple {12136#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12136#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:11,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {12136#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12137#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:11,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {12137#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12137#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:11,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {12137#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12137#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:11,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {12137#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12138#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:11,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {12138#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12138#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:11,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {12138#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12138#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:11,198 INFO L273 TraceCheckUtils]: 50: Hoare triple {12138#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12139#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:11,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {12139#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12139#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:11,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {12139#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12139#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:11,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {12139#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12140#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:11,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {12140#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12140#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:11,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {12140#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12140#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:11,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {12140#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12141#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:11,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {12141#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12141#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:11,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {12141#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12141#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:11,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {12141#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12142#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:11,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {12142#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12142#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:11,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {12142#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12142#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:11,205 INFO L273 TraceCheckUtils]: 62: Hoare triple {12142#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12143#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:11,206 INFO L273 TraceCheckUtils]: 63: Hoare triple {12143#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12143#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:11,206 INFO L273 TraceCheckUtils]: 64: Hoare triple {12143#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12143#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:11,207 INFO L273 TraceCheckUtils]: 65: Hoare triple {12143#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12144#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:11,208 INFO L273 TraceCheckUtils]: 66: Hoare triple {12144#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12123#false} is VALID [2018-11-23 11:59:11,208 INFO L273 TraceCheckUtils]: 67: Hoare triple {12123#false} havoc ~x~0; {12123#false} is VALID [2018-11-23 11:59:11,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {12123#false} assume 0 != ~rv~0;~x~0 := 0; {12123#false} is VALID [2018-11-23 11:59:11,209 INFO L273 TraceCheckUtils]: 69: Hoare triple {12123#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12123#false} is VALID [2018-11-23 11:59:11,209 INFO L256 TraceCheckUtils]: 70: Hoare triple {12123#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {12123#false} is VALID [2018-11-23 11:59:11,209 INFO L273 TraceCheckUtils]: 71: Hoare triple {12123#false} ~cond := #in~cond; {12123#false} is VALID [2018-11-23 11:59:11,209 INFO L273 TraceCheckUtils]: 72: Hoare triple {12123#false} assume 0 == ~cond; {12123#false} is VALID [2018-11-23 11:59:11,209 INFO L273 TraceCheckUtils]: 73: Hoare triple {12123#false} assume !false; {12123#false} is VALID [2018-11-23 11:59:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:11,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:11,215 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 11:59:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:11,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:11,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:11,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {12122#true} call ULTIMATE.init(); {12122#true} is VALID [2018-11-23 11:59:11,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {12122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12122#true} is VALID [2018-11-23 11:59:11,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {12122#true} assume true; {12122#true} is VALID [2018-11-23 11:59:11,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12122#true} {12122#true} #77#return; {12122#true} is VALID [2018-11-23 11:59:11,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {12122#true} call #t~ret9 := main(); {12122#true} is VALID [2018-11-23 11:59:11,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {12122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {12163#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {12163#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12163#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {12163#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12163#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {12163#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12125#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {12125#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12125#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {12125#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12125#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {12125#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12126#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {12126#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12126#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {12126#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12126#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {12126#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12127#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {12127#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12127#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {12127#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12127#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {12127#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12128#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:11,477 INFO L273 TraceCheckUtils]: 18: Hoare triple {12128#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12128#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:11,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {12128#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12128#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:11,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {12128#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12129#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:11,479 INFO L273 TraceCheckUtils]: 21: Hoare triple {12129#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12129#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:11,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {12129#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12129#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:11,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {12129#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12130#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:11,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {12130#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12130#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:11,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {12130#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12130#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:11,482 INFO L273 TraceCheckUtils]: 26: Hoare triple {12130#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12131#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:11,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {12131#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12131#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:11,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {12131#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12131#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:11,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {12131#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12132#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:11,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {12132#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12132#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:11,485 INFO L273 TraceCheckUtils]: 31: Hoare triple {12132#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12132#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:11,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {12132#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12133#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:11,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {12133#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12133#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:11,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {12133#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12133#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:11,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {12133#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12134#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:11,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {12134#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12134#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:11,489 INFO L273 TraceCheckUtils]: 37: Hoare triple {12134#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12134#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:11,490 INFO L273 TraceCheckUtils]: 38: Hoare triple {12134#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12135#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:11,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {12135#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12135#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:11,491 INFO L273 TraceCheckUtils]: 40: Hoare triple {12135#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12135#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:11,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {12135#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12136#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:11,493 INFO L273 TraceCheckUtils]: 42: Hoare triple {12136#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12136#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:11,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {12136#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12136#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:11,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {12136#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12137#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:11,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {12137#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12137#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:11,495 INFO L273 TraceCheckUtils]: 46: Hoare triple {12137#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12137#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:11,496 INFO L273 TraceCheckUtils]: 47: Hoare triple {12137#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12138#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:11,497 INFO L273 TraceCheckUtils]: 48: Hoare triple {12138#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12138#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:11,497 INFO L273 TraceCheckUtils]: 49: Hoare triple {12138#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12138#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:11,498 INFO L273 TraceCheckUtils]: 50: Hoare triple {12138#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12139#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:11,498 INFO L273 TraceCheckUtils]: 51: Hoare triple {12139#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12139#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:11,499 INFO L273 TraceCheckUtils]: 52: Hoare triple {12139#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12139#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:11,500 INFO L273 TraceCheckUtils]: 53: Hoare triple {12139#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12140#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:11,500 INFO L273 TraceCheckUtils]: 54: Hoare triple {12140#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12140#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:11,501 INFO L273 TraceCheckUtils]: 55: Hoare triple {12140#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12140#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:11,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {12140#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12141#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:11,502 INFO L273 TraceCheckUtils]: 57: Hoare triple {12141#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12141#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:11,503 INFO L273 TraceCheckUtils]: 58: Hoare triple {12141#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12141#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:11,503 INFO L273 TraceCheckUtils]: 59: Hoare triple {12141#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12142#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:11,504 INFO L273 TraceCheckUtils]: 60: Hoare triple {12142#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12142#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:11,504 INFO L273 TraceCheckUtils]: 61: Hoare triple {12142#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12142#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:11,505 INFO L273 TraceCheckUtils]: 62: Hoare triple {12142#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12143#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:11,506 INFO L273 TraceCheckUtils]: 63: Hoare triple {12143#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12143#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:11,506 INFO L273 TraceCheckUtils]: 64: Hoare triple {12143#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {12143#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:11,507 INFO L273 TraceCheckUtils]: 65: Hoare triple {12143#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {12144#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:11,508 INFO L273 TraceCheckUtils]: 66: Hoare triple {12144#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12123#false} is VALID [2018-11-23 11:59:11,508 INFO L273 TraceCheckUtils]: 67: Hoare triple {12123#false} havoc ~x~0; {12123#false} is VALID [2018-11-23 11:59:11,508 INFO L273 TraceCheckUtils]: 68: Hoare triple {12123#false} assume 0 != ~rv~0;~x~0 := 0; {12123#false} is VALID [2018-11-23 11:59:11,508 INFO L273 TraceCheckUtils]: 69: Hoare triple {12123#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12123#false} is VALID [2018-11-23 11:59:11,509 INFO L256 TraceCheckUtils]: 70: Hoare triple {12123#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {12123#false} is VALID [2018-11-23 11:59:11,509 INFO L273 TraceCheckUtils]: 71: Hoare triple {12123#false} ~cond := #in~cond; {12123#false} is VALID [2018-11-23 11:59:11,509 INFO L273 TraceCheckUtils]: 72: Hoare triple {12123#false} assume 0 == ~cond; {12123#false} is VALID [2018-11-23 11:59:11,509 INFO L273 TraceCheckUtils]: 73: Hoare triple {12123#false} assume !false; {12123#false} is VALID [2018-11-23 11:59:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:11,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:11,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:59:11,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-23 11:59:11,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:11,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:59:11,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:59:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:59:11,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:59:11,612 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand 24 states. [2018-11-23 11:59:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,148 INFO L93 Difference]: Finished difference Result 174 states and 227 transitions. [2018-11-23 11:59:12,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:59:12,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-23 11:59:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:59:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 136 transitions. [2018-11-23 11:59:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:59:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 136 transitions. [2018-11-23 11:59:12,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 136 transitions. [2018-11-23 11:59:12,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:12,278 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:59:12,278 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 11:59:12,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:59:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 11:59:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-11-23 11:59:12,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:12,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 151 states. [2018-11-23 11:59:12,322 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 151 states. [2018-11-23 11:59:12,322 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 151 states. [2018-11-23 11:59:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,326 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2018-11-23 11:59:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2018-11-23 11:59:12,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,327 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 155 states. [2018-11-23 11:59:12,327 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 155 states. [2018-11-23 11:59:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,330 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2018-11-23 11:59:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2018-11-23 11:59:12,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:12,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 11:59:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2018-11-23 11:59:12,334 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 74 [2018-11-23 11:59:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:12,334 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2018-11-23 11:59:12,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:59:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2018-11-23 11:59:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:59:12,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:12,335 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:12,336 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:12,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash 651158560, now seen corresponding path program 21 times [2018-11-23 11:59:12,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:12,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:12,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:12,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {13111#true} call ULTIMATE.init(); {13111#true} is VALID [2018-11-23 11:59:12,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {13111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13111#true} is VALID [2018-11-23 11:59:12,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {13111#true} assume true; {13111#true} is VALID [2018-11-23 11:59:12,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13111#true} {13111#true} #77#return; {13111#true} is VALID [2018-11-23 11:59:12,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {13111#true} call #t~ret9 := main(); {13111#true} is VALID [2018-11-23 11:59:12,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {13111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {13113#(= main_~i~0 0)} is VALID [2018-11-23 11:59:12,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {13113#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13113#(= main_~i~0 0)} is VALID [2018-11-23 11:59:12,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {13113#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13113#(= main_~i~0 0)} is VALID [2018-11-23 11:59:12,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {13113#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13114#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {13114#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13114#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {13114#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13114#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:12,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {13114#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13115#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {13115#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13115#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {13115#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13115#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {13115#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13116#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {13116#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13116#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {13116#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13116#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {13116#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13117#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {13117#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13117#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13117#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13118#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {13118#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13118#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {13118#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13118#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {13118#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13119#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {13119#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13119#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {13119#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13119#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {13119#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13120#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {13120#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13120#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {13120#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13120#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {13120#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13121#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {13121#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13121#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {13121#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13121#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {13121#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13122#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {13122#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13122#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {13122#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13122#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {13122#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13123#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {13123#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13123#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {13123#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13123#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {13123#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13124#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {13124#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13124#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {13124#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13124#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {13124#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13125#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {13125#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13125#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {13125#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13125#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,957 INFO L273 TraceCheckUtils]: 44: Hoare triple {13125#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13126#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,957 INFO L273 TraceCheckUtils]: 45: Hoare triple {13126#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13126#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {13126#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13126#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {13126#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13127#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {13127#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13127#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,960 INFO L273 TraceCheckUtils]: 49: Hoare triple {13127#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13127#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {13127#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13128#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,961 INFO L273 TraceCheckUtils]: 51: Hoare triple {13128#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13128#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,962 INFO L273 TraceCheckUtils]: 52: Hoare triple {13128#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13128#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,963 INFO L273 TraceCheckUtils]: 53: Hoare triple {13128#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13129#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,963 INFO L273 TraceCheckUtils]: 54: Hoare triple {13129#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13129#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,964 INFO L273 TraceCheckUtils]: 55: Hoare triple {13129#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13129#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,965 INFO L273 TraceCheckUtils]: 56: Hoare triple {13129#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13130#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,965 INFO L273 TraceCheckUtils]: 57: Hoare triple {13130#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13130#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,966 INFO L273 TraceCheckUtils]: 58: Hoare triple {13130#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13130#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {13130#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13131#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {13131#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13131#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {13131#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13131#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {13131#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13132#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {13132#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13132#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,970 INFO L273 TraceCheckUtils]: 64: Hoare triple {13132#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13132#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,971 INFO L273 TraceCheckUtils]: 65: Hoare triple {13132#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13133#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,971 INFO L273 TraceCheckUtils]: 66: Hoare triple {13133#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13133#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,972 INFO L273 TraceCheckUtils]: 67: Hoare triple {13133#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13133#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,973 INFO L273 TraceCheckUtils]: 68: Hoare triple {13133#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13134#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {13134#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13112#false} is VALID [2018-11-23 11:59:12,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {13112#false} havoc ~x~0; {13112#false} is VALID [2018-11-23 11:59:12,974 INFO L273 TraceCheckUtils]: 71: Hoare triple {13112#false} assume 0 != ~rv~0;~x~0 := 0; {13112#false} is VALID [2018-11-23 11:59:12,974 INFO L273 TraceCheckUtils]: 72: Hoare triple {13112#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {13112#false} is VALID [2018-11-23 11:59:12,974 INFO L256 TraceCheckUtils]: 73: Hoare triple {13112#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {13112#false} is VALID [2018-11-23 11:59:12,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {13112#false} ~cond := #in~cond; {13112#false} is VALID [2018-11-23 11:59:12,975 INFO L273 TraceCheckUtils]: 75: Hoare triple {13112#false} assume 0 == ~cond; {13112#false} is VALID [2018-11-23 11:59:12,975 INFO L273 TraceCheckUtils]: 76: Hoare triple {13112#false} assume !false; {13112#false} is VALID [2018-11-23 11:59:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:12,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:59:12,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:13,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 11:59:13,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:14,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {13111#true} call ULTIMATE.init(); {13111#true} is VALID [2018-11-23 11:59:14,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {13111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13111#true} is VALID [2018-11-23 11:59:14,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {13111#true} assume true; {13111#true} is VALID [2018-11-23 11:59:14,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13111#true} {13111#true} #77#return; {13111#true} is VALID [2018-11-23 11:59:14,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {13111#true} call #t~ret9 := main(); {13111#true} is VALID [2018-11-23 11:59:14,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {13111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {13153#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:14,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {13153#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13153#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:14,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {13153#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13153#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:14,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {13153#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13114#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:14,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {13114#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13114#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:14,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {13114#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13114#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:14,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {13114#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13115#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:14,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {13115#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13115#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:14,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {13115#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13115#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:14,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {13115#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13116#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:14,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {13116#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13116#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:14,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {13116#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13116#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:14,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {13116#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13117#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:14,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {13117#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13117#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:14,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13117#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:14,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13118#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:14,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {13118#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13118#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:14,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {13118#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13118#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:14,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {13118#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13119#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:14,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {13119#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13119#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:14,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {13119#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13119#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:14,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {13119#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13120#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:14,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {13120#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13120#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:14,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {13120#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13120#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:14,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {13120#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13121#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:14,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {13121#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13121#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:14,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {13121#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13121#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:14,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {13121#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13122#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:14,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {13122#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13122#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:14,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {13122#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13122#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:14,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {13122#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13123#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:14,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {13123#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13123#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:14,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {13123#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13123#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:14,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {13123#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13124#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:14,300 INFO L273 TraceCheckUtils]: 39: Hoare triple {13124#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13124#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:14,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {13124#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13124#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:14,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {13124#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13125#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:14,302 INFO L273 TraceCheckUtils]: 42: Hoare triple {13125#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13125#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:14,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {13125#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13125#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:14,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {13125#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13126#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:14,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {13126#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13126#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:14,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {13126#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13126#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:14,305 INFO L273 TraceCheckUtils]: 47: Hoare triple {13126#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13127#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:14,305 INFO L273 TraceCheckUtils]: 48: Hoare triple {13127#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13127#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:14,306 INFO L273 TraceCheckUtils]: 49: Hoare triple {13127#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13127#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:14,307 INFO L273 TraceCheckUtils]: 50: Hoare triple {13127#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13128#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:14,307 INFO L273 TraceCheckUtils]: 51: Hoare triple {13128#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13128#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:14,308 INFO L273 TraceCheckUtils]: 52: Hoare triple {13128#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13128#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:14,308 INFO L273 TraceCheckUtils]: 53: Hoare triple {13128#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13129#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:14,309 INFO L273 TraceCheckUtils]: 54: Hoare triple {13129#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13129#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:14,309 INFO L273 TraceCheckUtils]: 55: Hoare triple {13129#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13129#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:14,310 INFO L273 TraceCheckUtils]: 56: Hoare triple {13129#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13130#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:14,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {13130#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13130#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:14,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {13130#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13130#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:14,312 INFO L273 TraceCheckUtils]: 59: Hoare triple {13130#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13131#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:14,313 INFO L273 TraceCheckUtils]: 60: Hoare triple {13131#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13131#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:14,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {13131#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13131#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:14,314 INFO L273 TraceCheckUtils]: 62: Hoare triple {13131#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13132#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:14,315 INFO L273 TraceCheckUtils]: 63: Hoare triple {13132#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13132#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:14,315 INFO L273 TraceCheckUtils]: 64: Hoare triple {13132#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13132#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:14,316 INFO L273 TraceCheckUtils]: 65: Hoare triple {13132#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13133#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:14,316 INFO L273 TraceCheckUtils]: 66: Hoare triple {13133#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13133#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:14,317 INFO L273 TraceCheckUtils]: 67: Hoare triple {13133#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {13133#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:14,318 INFO L273 TraceCheckUtils]: 68: Hoare triple {13133#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {13134#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:14,318 INFO L273 TraceCheckUtils]: 69: Hoare triple {13134#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13112#false} is VALID [2018-11-23 11:59:14,319 INFO L273 TraceCheckUtils]: 70: Hoare triple {13112#false} havoc ~x~0; {13112#false} is VALID [2018-11-23 11:59:14,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {13112#false} assume 0 != ~rv~0;~x~0 := 0; {13112#false} is VALID [2018-11-23 11:59:14,319 INFO L273 TraceCheckUtils]: 72: Hoare triple {13112#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {13112#false} is VALID [2018-11-23 11:59:14,319 INFO L256 TraceCheckUtils]: 73: Hoare triple {13112#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {13112#false} is VALID [2018-11-23 11:59:14,319 INFO L273 TraceCheckUtils]: 74: Hoare triple {13112#false} ~cond := #in~cond; {13112#false} is VALID [2018-11-23 11:59:14,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {13112#false} assume 0 == ~cond; {13112#false} is VALID [2018-11-23 11:59:14,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {13112#false} assume !false; {13112#false} is VALID [2018-11-23 11:59:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:14,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:59:14,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-23 11:59:14,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:14,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:59:14,420 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 11:59:14,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:59:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:59:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:59:14,422 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand 25 states. [2018-11-23 11:59:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,943 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2018-11-23 11:59:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:59:14,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-23 11:59:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:59:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2018-11-23 11:59:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:59:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2018-11-23 11:59:14,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 140 transitions. [2018-11-23 11:59:15,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:15,080 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:59:15,080 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 11:59:15,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:59:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 11:59:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-11-23 11:59:15,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:15,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 157 states. [2018-11-23 11:59:15,141 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 157 states. [2018-11-23 11:59:15,141 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 157 states. [2018-11-23 11:59:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,145 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2018-11-23 11:59:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2018-11-23 11:59:15,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,146 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 161 states. [2018-11-23 11:59:15,146 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 161 states. [2018-11-23 11:59:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,149 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2018-11-23 11:59:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2018-11-23 11:59:15,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:15,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 11:59:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-23 11:59:15,153 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 77 [2018-11-23 11:59:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-23 11:59:15,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:59:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2018-11-23 11:59:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 11:59:15,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:15,155 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:15,155 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:15,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1589496096, now seen corresponding path program 22 times [2018-11-23 11:59:15,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {14138#true} call ULTIMATE.init(); {14138#true} is VALID [2018-11-23 11:59:16,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {14138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14138#true} is VALID [2018-11-23 11:59:16,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {14138#true} assume true; {14138#true} is VALID [2018-11-23 11:59:16,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14138#true} {14138#true} #77#return; {14138#true} is VALID [2018-11-23 11:59:16,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {14138#true} call #t~ret9 := main(); {14138#true} is VALID [2018-11-23 11:59:16,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {14138#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {14140#(= main_~i~0 0)} is VALID [2018-11-23 11:59:16,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {14140#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14140#(= main_~i~0 0)} is VALID [2018-11-23 11:59:16,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {14140#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14140#(= main_~i~0 0)} is VALID [2018-11-23 11:59:16,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {14140#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14141#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {14141#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14141#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {14141#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14141#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {14141#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14142#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {14142#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14142#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {14142#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14142#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {14142#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14143#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {14143#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14143#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {14143#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14143#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {14143#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14144#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {14144#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14144#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {14144#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14144#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {14144#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14145#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {14145#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14145#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {14145#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14145#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,248 INFO L273 TraceCheckUtils]: 23: Hoare triple {14145#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14146#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {14146#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14146#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,249 INFO L273 TraceCheckUtils]: 25: Hoare triple {14146#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14146#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {14146#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14147#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {14147#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14147#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {14147#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14147#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {14147#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14148#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {14148#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14148#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {14148#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14148#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {14148#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14149#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {14149#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14149#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {14149#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14149#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {14149#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14150#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {14150#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14150#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {14150#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14150#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {14150#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14151#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {14151#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14151#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {14151#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14151#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {14151#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14152#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {14152#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14152#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {14152#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14152#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {14152#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14153#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {14153#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14153#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {14153#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14153#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {14153#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14154#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,285 INFO L273 TraceCheckUtils]: 48: Hoare triple {14154#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14154#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {14154#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14154#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {14154#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14155#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {14155#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14155#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {14155#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14155#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {14155#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14156#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {14156#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14156#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {14156#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14156#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {14156#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14157#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,290 INFO L273 TraceCheckUtils]: 57: Hoare triple {14157#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14157#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {14157#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14157#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,292 INFO L273 TraceCheckUtils]: 59: Hoare triple {14157#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14158#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {14158#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14158#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {14158#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14158#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,294 INFO L273 TraceCheckUtils]: 62: Hoare triple {14158#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14159#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,294 INFO L273 TraceCheckUtils]: 63: Hoare triple {14159#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14159#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {14159#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14159#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,296 INFO L273 TraceCheckUtils]: 65: Hoare triple {14159#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14160#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {14160#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14160#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,297 INFO L273 TraceCheckUtils]: 67: Hoare triple {14160#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14160#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {14160#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14161#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,298 INFO L273 TraceCheckUtils]: 69: Hoare triple {14161#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14161#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,299 INFO L273 TraceCheckUtils]: 70: Hoare triple {14161#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14161#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,300 INFO L273 TraceCheckUtils]: 71: Hoare triple {14161#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14162#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:16,301 INFO L273 TraceCheckUtils]: 72: Hoare triple {14162#(<= main_~i~0 22)} assume !(~i~0 < 100000); {14139#false} is VALID [2018-11-23 11:59:16,301 INFO L273 TraceCheckUtils]: 73: Hoare triple {14139#false} havoc ~x~0; {14139#false} is VALID [2018-11-23 11:59:16,301 INFO L273 TraceCheckUtils]: 74: Hoare triple {14139#false} assume 0 != ~rv~0;~x~0 := 0; {14139#false} is VALID [2018-11-23 11:59:16,301 INFO L273 TraceCheckUtils]: 75: Hoare triple {14139#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14139#false} is VALID [2018-11-23 11:59:16,301 INFO L256 TraceCheckUtils]: 76: Hoare triple {14139#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {14139#false} is VALID [2018-11-23 11:59:16,302 INFO L273 TraceCheckUtils]: 77: Hoare triple {14139#false} ~cond := #in~cond; {14139#false} is VALID [2018-11-23 11:59:16,302 INFO L273 TraceCheckUtils]: 78: Hoare triple {14139#false} assume 0 == ~cond; {14139#false} is VALID [2018-11-23 11:59:16,302 INFO L273 TraceCheckUtils]: 79: Hoare triple {14139#false} assume !false; {14139#false} is VALID [2018-11-23 11:59:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:16,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:16,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:16,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:16,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:16,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {14138#true} call ULTIMATE.init(); {14138#true} is VALID [2018-11-23 11:59:16,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {14138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14138#true} is VALID [2018-11-23 11:59:16,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {14138#true} assume true; {14138#true} is VALID [2018-11-23 11:59:16,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14138#true} {14138#true} #77#return; {14138#true} is VALID [2018-11-23 11:59:16,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {14138#true} call #t~ret9 := main(); {14138#true} is VALID [2018-11-23 11:59:16,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {14138#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {14181#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {14181#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14181#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {14181#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14181#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {14181#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14141#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {14141#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14141#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {14141#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14141#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {14141#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14142#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {14142#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14142#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {14142#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14142#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {14142#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14143#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {14143#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14143#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {14143#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14143#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {14143#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14144#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {14144#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14144#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {14144#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14144#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {14144#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14145#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {14145#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14145#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {14145#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14145#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {14145#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14146#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {14146#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14146#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {14146#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14146#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {14146#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14147#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {14147#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14147#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {14147#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14147#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {14147#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14148#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {14148#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14148#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {14148#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14148#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {14148#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14149#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {14149#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14149#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {14149#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14149#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {14149#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14150#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {14150#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14150#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,693 INFO L273 TraceCheckUtils]: 37: Hoare triple {14150#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14150#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,693 INFO L273 TraceCheckUtils]: 38: Hoare triple {14150#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14151#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {14151#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14151#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,694 INFO L273 TraceCheckUtils]: 40: Hoare triple {14151#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14151#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {14151#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14152#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {14152#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14152#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {14152#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14152#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {14152#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14153#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,698 INFO L273 TraceCheckUtils]: 45: Hoare triple {14153#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14153#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,698 INFO L273 TraceCheckUtils]: 46: Hoare triple {14153#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14153#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,699 INFO L273 TraceCheckUtils]: 47: Hoare triple {14153#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14154#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,699 INFO L273 TraceCheckUtils]: 48: Hoare triple {14154#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14154#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,700 INFO L273 TraceCheckUtils]: 49: Hoare triple {14154#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14154#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,701 INFO L273 TraceCheckUtils]: 50: Hoare triple {14154#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14155#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,701 INFO L273 TraceCheckUtils]: 51: Hoare triple {14155#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14155#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,702 INFO L273 TraceCheckUtils]: 52: Hoare triple {14155#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14155#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {14155#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14156#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {14156#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14156#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {14156#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14156#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {14156#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14157#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,705 INFO L273 TraceCheckUtils]: 57: Hoare triple {14157#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14157#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {14157#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14157#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {14157#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14158#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {14158#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14158#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {14158#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14158#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {14158#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14159#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {14159#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14159#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {14159#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14159#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {14159#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14160#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,711 INFO L273 TraceCheckUtils]: 66: Hoare triple {14160#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14160#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {14160#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14160#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {14160#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14161#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {14161#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14161#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {14161#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {14161#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,714 INFO L273 TraceCheckUtils]: 71: Hoare triple {14161#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {14162#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:16,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {14162#(<= main_~i~0 22)} assume !(~i~0 < 100000); {14139#false} is VALID [2018-11-23 11:59:16,715 INFO L273 TraceCheckUtils]: 73: Hoare triple {14139#false} havoc ~x~0; {14139#false} is VALID [2018-11-23 11:59:16,715 INFO L273 TraceCheckUtils]: 74: Hoare triple {14139#false} assume 0 != ~rv~0;~x~0 := 0; {14139#false} is VALID [2018-11-23 11:59:16,715 INFO L273 TraceCheckUtils]: 75: Hoare triple {14139#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14139#false} is VALID [2018-11-23 11:59:16,715 INFO L256 TraceCheckUtils]: 76: Hoare triple {14139#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {14139#false} is VALID [2018-11-23 11:59:16,715 INFO L273 TraceCheckUtils]: 77: Hoare triple {14139#false} ~cond := #in~cond; {14139#false} is VALID [2018-11-23 11:59:16,716 INFO L273 TraceCheckUtils]: 78: Hoare triple {14139#false} assume 0 == ~cond; {14139#false} is VALID [2018-11-23 11:59:16,716 INFO L273 TraceCheckUtils]: 79: Hoare triple {14139#false} assume !false; {14139#false} is VALID [2018-11-23 11:59:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:16,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:59:16,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-23 11:59:16,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:16,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:59:16,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:16,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:59:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:59:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:16,824 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. Second operand 26 states. [2018-11-23 11:59:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,428 INFO L93 Difference]: Finished difference Result 186 states and 243 transitions. [2018-11-23 11:59:17,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:59:17,428 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-23 11:59:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 144 transitions. [2018-11-23 11:59:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 144 transitions. [2018-11-23 11:59:17,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 144 transitions. [2018-11-23 11:59:17,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:17,562 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:59:17,562 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:59:17,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:59:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-11-23 11:59:17,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:17,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 163 states. [2018-11-23 11:59:17,611 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 163 states. [2018-11-23 11:59:17,611 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 163 states. [2018-11-23 11:59:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,614 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2018-11-23 11:59:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2018-11-23 11:59:17,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,615 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 167 states. [2018-11-23 11:59:17,615 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 167 states. [2018-11-23 11:59:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,618 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2018-11-23 11:59:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2018-11-23 11:59:17,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:17,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 11:59:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2018-11-23 11:59:17,622 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 80 [2018-11-23 11:59:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:17,622 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2018-11-23 11:59:17,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:59:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2018-11-23 11:59:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:59:17,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:17,623 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:17,623 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:17,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -550638560, now seen corresponding path program 23 times [2018-11-23 11:59:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {15203#true} call ULTIMATE.init(); {15203#true} is VALID [2018-11-23 11:59:18,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {15203#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15203#true} is VALID [2018-11-23 11:59:18,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {15203#true} assume true; {15203#true} is VALID [2018-11-23 11:59:18,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15203#true} {15203#true} #77#return; {15203#true} is VALID [2018-11-23 11:59:18,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {15203#true} call #t~ret9 := main(); {15203#true} is VALID [2018-11-23 11:59:18,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {15203#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {15205#(= main_~i~0 0)} is VALID [2018-11-23 11:59:18,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {15205#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15205#(= main_~i~0 0)} is VALID [2018-11-23 11:59:18,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {15205#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15205#(= main_~i~0 0)} is VALID [2018-11-23 11:59:18,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {15205#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15206#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {15206#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15206#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {15206#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15206#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:18,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {15206#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15207#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {15207#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15207#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {15207#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15207#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {15207#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15208#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {15208#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15208#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {15208#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15208#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {15208#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15209#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {15209#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15209#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {15209#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15209#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {15209#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15210#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {15210#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15210#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {15210#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15210#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {15210#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15211#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {15211#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15211#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {15211#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15211#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {15211#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15212#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {15212#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15212#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {15212#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15212#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {15212#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15213#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {15213#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15213#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {15213#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15213#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {15213#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15214#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,172 INFO L273 TraceCheckUtils]: 33: Hoare triple {15214#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15214#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {15214#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15214#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {15214#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15215#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,174 INFO L273 TraceCheckUtils]: 36: Hoare triple {15215#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15215#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {15215#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15215#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {15215#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15216#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {15216#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15216#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {15216#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15216#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {15216#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15217#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {15217#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15217#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {15217#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15217#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {15217#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15218#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {15218#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15218#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {15218#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15218#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {15218#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15219#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {15219#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15219#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,192 INFO L273 TraceCheckUtils]: 49: Hoare triple {15219#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15219#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,192 INFO L273 TraceCheckUtils]: 50: Hoare triple {15219#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15220#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,194 INFO L273 TraceCheckUtils]: 51: Hoare triple {15220#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15220#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,194 INFO L273 TraceCheckUtils]: 52: Hoare triple {15220#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15220#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,196 INFO L273 TraceCheckUtils]: 53: Hoare triple {15220#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15221#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,196 INFO L273 TraceCheckUtils]: 54: Hoare triple {15221#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15221#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,199 INFO L273 TraceCheckUtils]: 55: Hoare triple {15221#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15221#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {15221#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15222#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {15222#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15222#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,202 INFO L273 TraceCheckUtils]: 58: Hoare triple {15222#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15222#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {15222#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15223#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {15223#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15223#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,207 INFO L273 TraceCheckUtils]: 61: Hoare triple {15223#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15223#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {15223#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15224#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,210 INFO L273 TraceCheckUtils]: 63: Hoare triple {15224#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15224#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,210 INFO L273 TraceCheckUtils]: 64: Hoare triple {15224#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15224#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,213 INFO L273 TraceCheckUtils]: 65: Hoare triple {15224#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15225#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,213 INFO L273 TraceCheckUtils]: 66: Hoare triple {15225#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15225#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {15225#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15225#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {15225#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15226#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,219 INFO L273 TraceCheckUtils]: 69: Hoare triple {15226#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15226#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,219 INFO L273 TraceCheckUtils]: 70: Hoare triple {15226#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15226#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {15226#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15227#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,222 INFO L273 TraceCheckUtils]: 72: Hoare triple {15227#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15227#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,225 INFO L273 TraceCheckUtils]: 73: Hoare triple {15227#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15227#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,225 INFO L273 TraceCheckUtils]: 74: Hoare triple {15227#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15228#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 75: Hoare triple {15228#(<= main_~i~0 23)} assume !(~i~0 < 100000); {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 76: Hoare triple {15204#false} havoc ~x~0; {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 77: Hoare triple {15204#false} assume 0 != ~rv~0;~x~0 := 0; {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 78: Hoare triple {15204#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L256 TraceCheckUtils]: 79: Hoare triple {15204#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 80: Hoare triple {15204#false} ~cond := #in~cond; {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 81: Hoare triple {15204#false} assume 0 == ~cond; {15204#false} is VALID [2018-11-23 11:59:18,227 INFO L273 TraceCheckUtils]: 82: Hoare triple {15204#false} assume !false; {15204#false} is VALID [2018-11-23 11:59:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:18,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:18,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:18,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:18,662 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:59:18,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:19,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {15203#true} call ULTIMATE.init(); {15203#true} is VALID [2018-11-23 11:59:19,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {15203#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15203#true} is VALID [2018-11-23 11:59:19,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {15203#true} assume true; {15203#true} is VALID [2018-11-23 11:59:19,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15203#true} {15203#true} #77#return; {15203#true} is VALID [2018-11-23 11:59:19,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {15203#true} call #t~ret9 := main(); {15203#true} is VALID [2018-11-23 11:59:19,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {15203#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {15247#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:19,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {15247#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15247#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:19,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {15247#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15247#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:19,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {15247#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15206#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:19,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {15206#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15206#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:19,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {15206#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15206#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:19,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {15206#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15207#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:19,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {15207#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15207#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:19,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {15207#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15207#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:19,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {15207#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15208#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:19,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {15208#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15208#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:19,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {15208#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15208#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:19,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {15208#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15209#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:19,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {15209#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15209#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:19,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {15209#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15209#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:19,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {15209#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15210#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:19,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {15210#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15210#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:19,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {15210#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15210#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:19,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {15210#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15211#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:19,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {15211#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15211#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:19,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {15211#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15211#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:19,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {15211#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15212#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:19,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {15212#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15212#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:19,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {15212#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15212#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:19,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {15212#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15213#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:19,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {15213#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15213#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:19,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {15213#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15213#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:19,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {15213#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15214#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:19,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {15214#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15214#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:19,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {15214#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15214#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:19,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {15214#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15215#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:19,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {15215#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15215#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:19,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {15215#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15215#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:19,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {15215#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15216#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:19,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {15216#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15216#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:19,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {15216#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15216#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:19,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {15216#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15217#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:19,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {15217#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15217#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:19,084 INFO L273 TraceCheckUtils]: 43: Hoare triple {15217#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15217#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:19,084 INFO L273 TraceCheckUtils]: 44: Hoare triple {15217#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15218#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:19,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {15218#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15218#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:19,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {15218#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15218#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:19,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {15218#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15219#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:19,087 INFO L273 TraceCheckUtils]: 48: Hoare triple {15219#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15219#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:19,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {15219#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15219#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:19,088 INFO L273 TraceCheckUtils]: 50: Hoare triple {15219#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15220#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:19,089 INFO L273 TraceCheckUtils]: 51: Hoare triple {15220#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15220#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:19,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {15220#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15220#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:19,090 INFO L273 TraceCheckUtils]: 53: Hoare triple {15220#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15221#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:19,090 INFO L273 TraceCheckUtils]: 54: Hoare triple {15221#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15221#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:19,091 INFO L273 TraceCheckUtils]: 55: Hoare triple {15221#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15221#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:19,092 INFO L273 TraceCheckUtils]: 56: Hoare triple {15221#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15222#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:19,092 INFO L273 TraceCheckUtils]: 57: Hoare triple {15222#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15222#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:19,093 INFO L273 TraceCheckUtils]: 58: Hoare triple {15222#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15222#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:19,094 INFO L273 TraceCheckUtils]: 59: Hoare triple {15222#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15223#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:19,094 INFO L273 TraceCheckUtils]: 60: Hoare triple {15223#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15223#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:19,095 INFO L273 TraceCheckUtils]: 61: Hoare triple {15223#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15223#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:19,096 INFO L273 TraceCheckUtils]: 62: Hoare triple {15223#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15224#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:19,096 INFO L273 TraceCheckUtils]: 63: Hoare triple {15224#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15224#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:19,097 INFO L273 TraceCheckUtils]: 64: Hoare triple {15224#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15224#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:19,097 INFO L273 TraceCheckUtils]: 65: Hoare triple {15224#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15225#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:19,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {15225#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15225#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:19,098 INFO L273 TraceCheckUtils]: 67: Hoare triple {15225#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15225#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:19,099 INFO L273 TraceCheckUtils]: 68: Hoare triple {15225#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15226#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:19,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {15226#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15226#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:19,100 INFO L273 TraceCheckUtils]: 70: Hoare triple {15226#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15226#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:19,101 INFO L273 TraceCheckUtils]: 71: Hoare triple {15226#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15227#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:19,102 INFO L273 TraceCheckUtils]: 72: Hoare triple {15227#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15227#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:19,102 INFO L273 TraceCheckUtils]: 73: Hoare triple {15227#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {15227#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:19,103 INFO L273 TraceCheckUtils]: 74: Hoare triple {15227#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {15228#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:19,104 INFO L273 TraceCheckUtils]: 75: Hoare triple {15228#(<= main_~i~0 23)} assume !(~i~0 < 100000); {15204#false} is VALID [2018-11-23 11:59:19,104 INFO L273 TraceCheckUtils]: 76: Hoare triple {15204#false} havoc ~x~0; {15204#false} is VALID [2018-11-23 11:59:19,104 INFO L273 TraceCheckUtils]: 77: Hoare triple {15204#false} assume 0 != ~rv~0;~x~0 := 0; {15204#false} is VALID [2018-11-23 11:59:19,104 INFO L273 TraceCheckUtils]: 78: Hoare triple {15204#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {15204#false} is VALID [2018-11-23 11:59:19,104 INFO L256 TraceCheckUtils]: 79: Hoare triple {15204#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {15204#false} is VALID [2018-11-23 11:59:19,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {15204#false} ~cond := #in~cond; {15204#false} is VALID [2018-11-23 11:59:19,105 INFO L273 TraceCheckUtils]: 81: Hoare triple {15204#false} assume 0 == ~cond; {15204#false} is VALID [2018-11-23 11:59:19,105 INFO L273 TraceCheckUtils]: 82: Hoare triple {15204#false} assume !false; {15204#false} is VALID [2018-11-23 11:59:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:19,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:19,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:59:19,131 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-23 11:59:19,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:19,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:59:19,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:59:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:59:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:19,229 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand 27 states. [2018-11-23 11:59:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,118 INFO L93 Difference]: Finished difference Result 192 states and 251 transitions. [2018-11-23 11:59:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:59:20,118 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-23 11:59:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions. [2018-11-23 11:59:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions. [2018-11-23 11:59:20,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 148 transitions. [2018-11-23 11:59:20,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:20,312 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:59:20,312 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:59:20,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:59:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2018-11-23 11:59:20,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:20,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 169 states. [2018-11-23 11:59:20,380 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 169 states. [2018-11-23 11:59:20,380 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 169 states. [2018-11-23 11:59:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,384 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2018-11-23 11:59:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2018-11-23 11:59:20,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,384 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 173 states. [2018-11-23 11:59:20,384 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 173 states. [2018-11-23 11:59:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,387 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2018-11-23 11:59:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2018-11-23 11:59:20,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:20,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-23 11:59:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2018-11-23 11:59:20,391 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 83 [2018-11-23 11:59:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:20,391 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2018-11-23 11:59:20,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:59:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2018-11-23 11:59:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 11:59:20,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:20,392 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:20,393 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:20,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1480118560, now seen corresponding path program 24 times [2018-11-23 11:59:20,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:20,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:20,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:20,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:21,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {16306#true} call ULTIMATE.init(); {16306#true} is VALID [2018-11-23 11:59:21,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {16306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16306#true} is VALID [2018-11-23 11:59:21,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {16306#true} assume true; {16306#true} is VALID [2018-11-23 11:59:21,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16306#true} {16306#true} #77#return; {16306#true} is VALID [2018-11-23 11:59:21,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {16306#true} call #t~ret9 := main(); {16306#true} is VALID [2018-11-23 11:59:21,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {16306#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {16308#(= main_~i~0 0)} is VALID [2018-11-23 11:59:21,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {16308#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16308#(= main_~i~0 0)} is VALID [2018-11-23 11:59:21,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {16308#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16308#(= main_~i~0 0)} is VALID [2018-11-23 11:59:21,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {16308#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16309#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:21,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {16309#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16309#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:21,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {16309#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16309#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:21,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {16309#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16310#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:21,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {16310#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16310#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:21,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {16310#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16310#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:21,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {16310#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16311#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:21,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {16311#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16311#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:21,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {16311#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16311#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:21,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {16311#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16312#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:21,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {16312#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16312#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:21,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {16312#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16312#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:21,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {16312#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16313#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:21,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {16313#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16313#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:21,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {16313#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16313#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:21,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {16313#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16314#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:21,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {16314#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16314#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:21,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {16314#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16314#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:21,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {16314#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16315#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:21,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {16315#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16315#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:21,400 INFO L273 TraceCheckUtils]: 28: Hoare triple {16315#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16315#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:21,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {16315#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16316#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:21,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {16316#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16316#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:21,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {16316#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16316#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:21,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {16316#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16317#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:21,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {16317#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16317#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:21,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {16317#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16317#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:21,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {16317#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16318#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:21,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {16318#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16318#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:21,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {16318#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16318#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:21,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {16318#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16319#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:21,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {16319#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16319#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:21,407 INFO L273 TraceCheckUtils]: 40: Hoare triple {16319#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16319#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:21,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {16319#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16320#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:21,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {16320#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16320#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:21,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {16320#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16320#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:21,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {16320#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16321#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:21,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {16321#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16321#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:21,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {16321#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16321#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:21,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {16321#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16322#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:21,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {16322#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16322#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:21,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {16322#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16322#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:21,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {16322#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16323#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:21,414 INFO L273 TraceCheckUtils]: 51: Hoare triple {16323#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16323#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:21,415 INFO L273 TraceCheckUtils]: 52: Hoare triple {16323#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16323#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:21,415 INFO L273 TraceCheckUtils]: 53: Hoare triple {16323#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16324#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:21,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {16324#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16324#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:21,416 INFO L273 TraceCheckUtils]: 55: Hoare triple {16324#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16324#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:21,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {16324#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16325#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:21,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {16325#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16325#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:21,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {16325#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16325#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:21,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {16325#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16326#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:21,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {16326#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16326#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:21,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {16326#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16326#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:21,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {16326#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16327#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:21,422 INFO L273 TraceCheckUtils]: 63: Hoare triple {16327#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16327#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:21,422 INFO L273 TraceCheckUtils]: 64: Hoare triple {16327#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16327#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:21,423 INFO L273 TraceCheckUtils]: 65: Hoare triple {16327#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16328#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:21,423 INFO L273 TraceCheckUtils]: 66: Hoare triple {16328#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16328#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:21,424 INFO L273 TraceCheckUtils]: 67: Hoare triple {16328#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16328#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:21,425 INFO L273 TraceCheckUtils]: 68: Hoare triple {16328#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16329#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:21,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {16329#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16329#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:21,426 INFO L273 TraceCheckUtils]: 70: Hoare triple {16329#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16329#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:21,427 INFO L273 TraceCheckUtils]: 71: Hoare triple {16329#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16330#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:21,427 INFO L273 TraceCheckUtils]: 72: Hoare triple {16330#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16330#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:21,428 INFO L273 TraceCheckUtils]: 73: Hoare triple {16330#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16330#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:21,428 INFO L273 TraceCheckUtils]: 74: Hoare triple {16330#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16331#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:21,429 INFO L273 TraceCheckUtils]: 75: Hoare triple {16331#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16331#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:21,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {16331#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16331#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:21,430 INFO L273 TraceCheckUtils]: 77: Hoare triple {16331#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16332#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:21,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {16332#(<= main_~i~0 24)} assume !(~i~0 < 100000); {16307#false} is VALID [2018-11-23 11:59:21,431 INFO L273 TraceCheckUtils]: 79: Hoare triple {16307#false} havoc ~x~0; {16307#false} is VALID [2018-11-23 11:59:21,431 INFO L273 TraceCheckUtils]: 80: Hoare triple {16307#false} assume 0 != ~rv~0;~x~0 := 0; {16307#false} is VALID [2018-11-23 11:59:21,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {16307#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {16307#false} is VALID [2018-11-23 11:59:21,432 INFO L256 TraceCheckUtils]: 82: Hoare triple {16307#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {16307#false} is VALID [2018-11-23 11:59:21,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {16307#false} ~cond := #in~cond; {16307#false} is VALID [2018-11-23 11:59:21,432 INFO L273 TraceCheckUtils]: 84: Hoare triple {16307#false} assume 0 == ~cond; {16307#false} is VALID [2018-11-23 11:59:21,432 INFO L273 TraceCheckUtils]: 85: Hoare triple {16307#false} assume !false; {16307#false} is VALID [2018-11-23 11:59:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:21,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:21,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:23,542 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 11:59:23,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:23,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {16306#true} call ULTIMATE.init(); {16306#true} is VALID [2018-11-23 11:59:23,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {16306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16306#true} is VALID [2018-11-23 11:59:23,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {16306#true} assume true; {16306#true} is VALID [2018-11-23 11:59:23,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16306#true} {16306#true} #77#return; {16306#true} is VALID [2018-11-23 11:59:23,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {16306#true} call #t~ret9 := main(); {16306#true} is VALID [2018-11-23 11:59:23,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {16306#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {16351#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:23,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {16351#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16351#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:23,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {16351#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16351#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {16351#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16309#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {16309#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16309#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {16309#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16309#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {16309#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16310#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {16310#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16310#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {16310#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16310#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {16310#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16311#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {16311#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16311#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {16311#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16311#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {16311#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16312#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {16312#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16312#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {16312#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16312#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {16312#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16313#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {16313#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16313#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {16313#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16313#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {16313#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16314#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {16314#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16314#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {16314#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16314#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {16314#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16315#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {16315#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16315#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {16315#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16315#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {16315#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16316#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {16316#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16316#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {16316#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16316#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {16316#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16317#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {16317#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16317#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {16317#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16317#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {16317#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16318#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {16318#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16318#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {16318#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16318#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {16318#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16319#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {16319#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16319#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {16319#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16319#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,843 INFO L273 TraceCheckUtils]: 41: Hoare triple {16319#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16320#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,844 INFO L273 TraceCheckUtils]: 42: Hoare triple {16320#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16320#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,844 INFO L273 TraceCheckUtils]: 43: Hoare triple {16320#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16320#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {16320#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16321#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {16321#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16321#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,846 INFO L273 TraceCheckUtils]: 46: Hoare triple {16321#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16321#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {16321#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16322#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,847 INFO L273 TraceCheckUtils]: 48: Hoare triple {16322#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16322#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,848 INFO L273 TraceCheckUtils]: 49: Hoare triple {16322#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16322#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,849 INFO L273 TraceCheckUtils]: 50: Hoare triple {16322#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16323#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,849 INFO L273 TraceCheckUtils]: 51: Hoare triple {16323#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16323#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,850 INFO L273 TraceCheckUtils]: 52: Hoare triple {16323#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16323#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,851 INFO L273 TraceCheckUtils]: 53: Hoare triple {16323#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16324#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,851 INFO L273 TraceCheckUtils]: 54: Hoare triple {16324#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16324#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {16324#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16324#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,853 INFO L273 TraceCheckUtils]: 56: Hoare triple {16324#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16325#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,853 INFO L273 TraceCheckUtils]: 57: Hoare triple {16325#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16325#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,854 INFO L273 TraceCheckUtils]: 58: Hoare triple {16325#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16325#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,855 INFO L273 TraceCheckUtils]: 59: Hoare triple {16325#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16326#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,855 INFO L273 TraceCheckUtils]: 60: Hoare triple {16326#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16326#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,856 INFO L273 TraceCheckUtils]: 61: Hoare triple {16326#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16326#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,857 INFO L273 TraceCheckUtils]: 62: Hoare triple {16326#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16327#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,857 INFO L273 TraceCheckUtils]: 63: Hoare triple {16327#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16327#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,858 INFO L273 TraceCheckUtils]: 64: Hoare triple {16327#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16327#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {16327#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16328#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:23,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {16328#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16328#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:23,860 INFO L273 TraceCheckUtils]: 67: Hoare triple {16328#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16328#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:23,861 INFO L273 TraceCheckUtils]: 68: Hoare triple {16328#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16329#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:23,861 INFO L273 TraceCheckUtils]: 69: Hoare triple {16329#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16329#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:23,862 INFO L273 TraceCheckUtils]: 70: Hoare triple {16329#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16329#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:23,863 INFO L273 TraceCheckUtils]: 71: Hoare triple {16329#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16330#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:23,863 INFO L273 TraceCheckUtils]: 72: Hoare triple {16330#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16330#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:23,864 INFO L273 TraceCheckUtils]: 73: Hoare triple {16330#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16330#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:23,864 INFO L273 TraceCheckUtils]: 74: Hoare triple {16330#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16331#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:23,865 INFO L273 TraceCheckUtils]: 75: Hoare triple {16331#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16331#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:23,865 INFO L273 TraceCheckUtils]: 76: Hoare triple {16331#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {16331#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:23,866 INFO L273 TraceCheckUtils]: 77: Hoare triple {16331#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {16332#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:23,867 INFO L273 TraceCheckUtils]: 78: Hoare triple {16332#(<= main_~i~0 24)} assume !(~i~0 < 100000); {16307#false} is VALID [2018-11-23 11:59:23,867 INFO L273 TraceCheckUtils]: 79: Hoare triple {16307#false} havoc ~x~0; {16307#false} is VALID [2018-11-23 11:59:23,867 INFO L273 TraceCheckUtils]: 80: Hoare triple {16307#false} assume 0 != ~rv~0;~x~0 := 0; {16307#false} is VALID [2018-11-23 11:59:23,868 INFO L273 TraceCheckUtils]: 81: Hoare triple {16307#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {16307#false} is VALID [2018-11-23 11:59:23,868 INFO L256 TraceCheckUtils]: 82: Hoare triple {16307#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {16307#false} is VALID [2018-11-23 11:59:23,868 INFO L273 TraceCheckUtils]: 83: Hoare triple {16307#false} ~cond := #in~cond; {16307#false} is VALID [2018-11-23 11:59:23,868 INFO L273 TraceCheckUtils]: 84: Hoare triple {16307#false} assume 0 == ~cond; {16307#false} is VALID [2018-11-23 11:59:23,868 INFO L273 TraceCheckUtils]: 85: Hoare triple {16307#false} assume !false; {16307#false} is VALID [2018-11-23 11:59:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:23,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:23,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 11:59:23,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-23 11:59:23,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:23,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:59:23,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:23,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:59:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:59:23,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:23,996 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand 28 states. [2018-11-23 11:59:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,525 INFO L93 Difference]: Finished difference Result 198 states and 259 transitions. [2018-11-23 11:59:24,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:59:24,525 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-23 11:59:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 152 transitions. [2018-11-23 11:59:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 152 transitions. [2018-11-23 11:59:24,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 152 transitions. [2018-11-23 11:59:24,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:24,684 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:59:24,684 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 11:59:24,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 11:59:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-11-23 11:59:24,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:24,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 175 states. [2018-11-23 11:59:24,757 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 175 states. [2018-11-23 11:59:24,758 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 175 states. [2018-11-23 11:59:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,762 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2018-11-23 11:59:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2018-11-23 11:59:24,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,762 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 179 states. [2018-11-23 11:59:24,763 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 179 states. [2018-11-23 11:59:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,765 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2018-11-23 11:59:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2018-11-23 11:59:24,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:24,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-23 11:59:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2018-11-23 11:59:24,769 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 229 transitions. Word has length 86 [2018-11-23 11:59:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:24,769 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 229 transitions. [2018-11-23 11:59:24,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:59:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 229 transitions. [2018-11-23 11:59:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:59:24,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:24,770 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:24,770 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:24,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1964641248, now seen corresponding path program 25 times [2018-11-23 11:59:24,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {17447#true} call ULTIMATE.init(); {17447#true} is VALID [2018-11-23 11:59:25,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {17447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17447#true} is VALID [2018-11-23 11:59:25,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {17447#true} assume true; {17447#true} is VALID [2018-11-23 11:59:25,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17447#true} {17447#true} #77#return; {17447#true} is VALID [2018-11-23 11:59:25,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {17447#true} call #t~ret9 := main(); {17447#true} is VALID [2018-11-23 11:59:25,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {17447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {17449#(= main_~i~0 0)} is VALID [2018-11-23 11:59:25,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {17449#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17449#(= main_~i~0 0)} is VALID [2018-11-23 11:59:25,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {17449#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17449#(= main_~i~0 0)} is VALID [2018-11-23 11:59:25,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {17449#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17450#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {17450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17450#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {17450#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17450#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {17450#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17451#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {17451#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17451#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {17451#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17451#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {17451#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17452#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {17452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17452#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {17452#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17452#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {17452#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17453#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {17453#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17453#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {17453#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17453#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {17453#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17454#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {17454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17454#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {17454#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17454#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {17454#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17455#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {17455#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17455#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {17455#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17455#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {17455#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17456#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {17456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17456#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {17456#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17456#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {17456#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17457#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {17457#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17457#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {17457#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17457#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {17457#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17458#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {17458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17458#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {17458#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17458#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {17458#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17459#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {17459#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17459#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,640 INFO L273 TraceCheckUtils]: 37: Hoare triple {17459#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17459#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {17459#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17460#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {17460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17460#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {17460#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17460#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {17460#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17461#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {17461#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17461#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {17461#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17461#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17462#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,645 INFO L273 TraceCheckUtils]: 45: Hoare triple {17462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17462#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17462#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17463#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17463#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {17463#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17463#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {17463#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17464#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {17464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17464#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {17464#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17464#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {17464#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17465#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,651 INFO L273 TraceCheckUtils]: 54: Hoare triple {17465#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17465#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,651 INFO L273 TraceCheckUtils]: 55: Hoare triple {17465#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17465#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {17465#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17466#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {17466#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17466#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {17466#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17466#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {17466#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17467#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {17467#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17467#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {17467#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17467#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {17467#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17468#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {17468#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17468#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,657 INFO L273 TraceCheckUtils]: 64: Hoare triple {17468#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17468#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {17468#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17469#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {17469#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17469#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,659 INFO L273 TraceCheckUtils]: 67: Hoare triple {17469#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17469#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,659 INFO L273 TraceCheckUtils]: 68: Hoare triple {17469#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17470#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {17470#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17470#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {17470#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17470#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,661 INFO L273 TraceCheckUtils]: 71: Hoare triple {17470#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17471#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,662 INFO L273 TraceCheckUtils]: 72: Hoare triple {17471#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17471#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,662 INFO L273 TraceCheckUtils]: 73: Hoare triple {17471#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17471#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,663 INFO L273 TraceCheckUtils]: 74: Hoare triple {17471#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17472#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,664 INFO L273 TraceCheckUtils]: 75: Hoare triple {17472#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17472#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {17472#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17472#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,665 INFO L273 TraceCheckUtils]: 77: Hoare triple {17472#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17473#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,666 INFO L273 TraceCheckUtils]: 78: Hoare triple {17473#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17473#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,666 INFO L273 TraceCheckUtils]: 79: Hoare triple {17473#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17473#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,667 INFO L273 TraceCheckUtils]: 80: Hoare triple {17473#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17474#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,668 INFO L273 TraceCheckUtils]: 81: Hoare triple {17474#(<= main_~i~0 25)} assume !(~i~0 < 100000); {17448#false} is VALID [2018-11-23 11:59:25,668 INFO L273 TraceCheckUtils]: 82: Hoare triple {17448#false} havoc ~x~0; {17448#false} is VALID [2018-11-23 11:59:25,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {17448#false} assume 0 != ~rv~0;~x~0 := 0; {17448#false} is VALID [2018-11-23 11:59:25,668 INFO L273 TraceCheckUtils]: 84: Hoare triple {17448#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {17448#false} is VALID [2018-11-23 11:59:25,669 INFO L256 TraceCheckUtils]: 85: Hoare triple {17448#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {17448#false} is VALID [2018-11-23 11:59:25,669 INFO L273 TraceCheckUtils]: 86: Hoare triple {17448#false} ~cond := #in~cond; {17448#false} is VALID [2018-11-23 11:59:25,669 INFO L273 TraceCheckUtils]: 87: Hoare triple {17448#false} assume 0 == ~cond; {17448#false} is VALID [2018-11-23 11:59:25,669 INFO L273 TraceCheckUtils]: 88: Hoare triple {17448#false} assume !false; {17448#false} is VALID [2018-11-23 11:59:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:25,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:25,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:25,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {17447#true} call ULTIMATE.init(); {17447#true} is VALID [2018-11-23 11:59:25,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {17447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17447#true} is VALID [2018-11-23 11:59:25,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {17447#true} assume true; {17447#true} is VALID [2018-11-23 11:59:25,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17447#true} {17447#true} #77#return; {17447#true} is VALID [2018-11-23 11:59:25,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {17447#true} call #t~ret9 := main(); {17447#true} is VALID [2018-11-23 11:59:25,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {17447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {17493#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:25,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {17493#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17493#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:25,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {17493#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17493#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:25,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {17493#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17450#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {17450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17450#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {17450#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17450#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:25,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {17450#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17451#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {17451#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17451#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {17451#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17451#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {17451#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17452#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {17452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17452#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {17452#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17452#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {17452#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17453#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {17453#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17453#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {17453#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17453#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,983 INFO L273 TraceCheckUtils]: 20: Hoare triple {17453#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17454#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {17454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17454#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {17454#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17454#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {17454#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17455#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {17455#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17455#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {17455#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17455#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {17455#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17456#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {17456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17456#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,987 INFO L273 TraceCheckUtils]: 28: Hoare triple {17456#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17456#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {17456#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17457#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,988 INFO L273 TraceCheckUtils]: 30: Hoare triple {17457#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17457#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {17457#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17457#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {17457#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17458#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {17458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17458#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {17458#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17458#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {17458#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17459#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {17459#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17459#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {17459#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17459#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {17459#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17460#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {17460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17460#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {17460#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17460#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {17460#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17461#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {17461#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17461#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {17461#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17461#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17462#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {17462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17462#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,998 INFO L273 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17462#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,999 INFO L273 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17463#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17463#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,999 INFO L273 TraceCheckUtils]: 49: Hoare triple {17463#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17463#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:26,000 INFO L273 TraceCheckUtils]: 50: Hoare triple {17463#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17464#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:26,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {17464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17464#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:26,001 INFO L273 TraceCheckUtils]: 52: Hoare triple {17464#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17464#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:26,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {17464#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17465#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:26,003 INFO L273 TraceCheckUtils]: 54: Hoare triple {17465#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17465#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:26,003 INFO L273 TraceCheckUtils]: 55: Hoare triple {17465#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17465#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:26,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {17465#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17466#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:26,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {17466#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17466#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:26,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {17466#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17466#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:26,006 INFO L273 TraceCheckUtils]: 59: Hoare triple {17466#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17467#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:26,006 INFO L273 TraceCheckUtils]: 60: Hoare triple {17467#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17467#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:26,007 INFO L273 TraceCheckUtils]: 61: Hoare triple {17467#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17467#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:26,008 INFO L273 TraceCheckUtils]: 62: Hoare triple {17467#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17468#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:26,008 INFO L273 TraceCheckUtils]: 63: Hoare triple {17468#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17468#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:26,009 INFO L273 TraceCheckUtils]: 64: Hoare triple {17468#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17468#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:26,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {17468#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17469#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:26,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {17469#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17469#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:26,011 INFO L273 TraceCheckUtils]: 67: Hoare triple {17469#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17469#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:26,011 INFO L273 TraceCheckUtils]: 68: Hoare triple {17469#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17470#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:26,012 INFO L273 TraceCheckUtils]: 69: Hoare triple {17470#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17470#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:26,012 INFO L273 TraceCheckUtils]: 70: Hoare triple {17470#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17470#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:26,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {17470#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17471#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:26,014 INFO L273 TraceCheckUtils]: 72: Hoare triple {17471#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17471#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:26,014 INFO L273 TraceCheckUtils]: 73: Hoare triple {17471#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17471#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:26,015 INFO L273 TraceCheckUtils]: 74: Hoare triple {17471#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17472#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:26,016 INFO L273 TraceCheckUtils]: 75: Hoare triple {17472#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17472#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:26,016 INFO L273 TraceCheckUtils]: 76: Hoare triple {17472#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17472#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:26,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {17472#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17473#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:26,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {17473#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17473#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:26,018 INFO L273 TraceCheckUtils]: 79: Hoare triple {17473#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {17473#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:26,019 INFO L273 TraceCheckUtils]: 80: Hoare triple {17473#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {17474#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:26,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {17474#(<= main_~i~0 25)} assume !(~i~0 < 100000); {17448#false} is VALID [2018-11-23 11:59:26,020 INFO L273 TraceCheckUtils]: 82: Hoare triple {17448#false} havoc ~x~0; {17448#false} is VALID [2018-11-23 11:59:26,020 INFO L273 TraceCheckUtils]: 83: Hoare triple {17448#false} assume 0 != ~rv~0;~x~0 := 0; {17448#false} is VALID [2018-11-23 11:59:26,020 INFO L273 TraceCheckUtils]: 84: Hoare triple {17448#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {17448#false} is VALID [2018-11-23 11:59:26,021 INFO L256 TraceCheckUtils]: 85: Hoare triple {17448#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {17448#false} is VALID [2018-11-23 11:59:26,021 INFO L273 TraceCheckUtils]: 86: Hoare triple {17448#false} ~cond := #in~cond; {17448#false} is VALID [2018-11-23 11:59:26,021 INFO L273 TraceCheckUtils]: 87: Hoare triple {17448#false} assume 0 == ~cond; {17448#false} is VALID [2018-11-23 11:59:26,021 INFO L273 TraceCheckUtils]: 88: Hoare triple {17448#false} assume !false; {17448#false} is VALID [2018-11-23 11:59:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:26,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:26,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:59:26,046 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-11-23 11:59:26,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:26,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:59:26,136 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 11:59:26,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:59:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:59:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:26,137 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand 29 states. [2018-11-23 11:59:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,566 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2018-11-23 11:59:26,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:59:26,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-11-23 11:59:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 156 transitions. [2018-11-23 11:59:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 156 transitions. [2018-11-23 11:59:26,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 156 transitions. [2018-11-23 11:59:27,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:27,514 INFO L225 Difference]: With dead ends: 204 [2018-11-23 11:59:27,515 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:59:27,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:59:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2018-11-23 11:59:28,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:28,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 181 states. [2018-11-23 11:59:28,150 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 181 states. [2018-11-23 11:59:28,151 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 181 states. [2018-11-23 11:59:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:28,155 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2018-11-23 11:59:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2018-11-23 11:59:28,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:28,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:28,156 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 185 states. [2018-11-23 11:59:28,156 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 185 states. [2018-11-23 11:59:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:28,160 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2018-11-23 11:59:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2018-11-23 11:59:28,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:28,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:28,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:28,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-23 11:59:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2018-11-23 11:59:28,165 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 89 [2018-11-23 11:59:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:28,166 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2018-11-23 11:59:28,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:59:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2018-11-23 11:59:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 11:59:28,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:28,167 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:28,167 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:28,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:28,167 INFO L82 PathProgramCache]: Analyzing trace with hash -994957600, now seen corresponding path program 26 times [2018-11-23 11:59:28,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:28,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:28,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:29,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {18626#true} call ULTIMATE.init(); {18626#true} is VALID [2018-11-23 11:59:29,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {18626#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18626#true} is VALID [2018-11-23 11:59:29,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {18626#true} assume true; {18626#true} is VALID [2018-11-23 11:59:29,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18626#true} {18626#true} #77#return; {18626#true} is VALID [2018-11-23 11:59:29,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {18626#true} call #t~ret9 := main(); {18626#true} is VALID [2018-11-23 11:59:29,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {18626#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {18628#(= main_~i~0 0)} is VALID [2018-11-23 11:59:29,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {18628#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18628#(= main_~i~0 0)} is VALID [2018-11-23 11:59:29,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {18628#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18628#(= main_~i~0 0)} is VALID [2018-11-23 11:59:29,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {18628#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18629#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {18629#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18629#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {18629#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18629#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {18629#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18630#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {18630#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18630#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {18630#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18630#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {18630#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18631#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {18631#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18631#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {18631#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18631#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {18631#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18632#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {18632#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18632#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {18632#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18632#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {18632#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {18633#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {18633#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {18633#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18634#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {18634#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18634#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {18634#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18634#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {18634#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18635#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {18635#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18635#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {18635#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18635#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,493 INFO L273 TraceCheckUtils]: 29: Hoare triple {18635#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18636#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {18636#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18636#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {18636#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18636#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {18636#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18637#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {18637#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18637#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {18637#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18637#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {18637#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18638#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {18638#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18638#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {18638#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18638#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {18638#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18639#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {18639#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18639#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {18639#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18639#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {18639#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18640#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {18640#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18640#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {18640#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18640#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {18640#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18641#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {18641#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18641#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,527 INFO L273 TraceCheckUtils]: 46: Hoare triple {18641#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18641#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,528 INFO L273 TraceCheckUtils]: 47: Hoare triple {18641#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18642#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,529 INFO L273 TraceCheckUtils]: 48: Hoare triple {18642#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18642#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,529 INFO L273 TraceCheckUtils]: 49: Hoare triple {18642#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18642#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,530 INFO L273 TraceCheckUtils]: 50: Hoare triple {18642#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18643#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,531 INFO L273 TraceCheckUtils]: 51: Hoare triple {18643#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18643#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,531 INFO L273 TraceCheckUtils]: 52: Hoare triple {18643#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18643#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,532 INFO L273 TraceCheckUtils]: 53: Hoare triple {18643#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18644#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,533 INFO L273 TraceCheckUtils]: 54: Hoare triple {18644#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18644#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,533 INFO L273 TraceCheckUtils]: 55: Hoare triple {18644#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18644#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,534 INFO L273 TraceCheckUtils]: 56: Hoare triple {18644#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18645#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {18645#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18645#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {18645#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18645#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {18645#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18646#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {18646#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18646#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {18646#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18646#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {18646#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18647#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {18647#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18647#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,540 INFO L273 TraceCheckUtils]: 64: Hoare triple {18647#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18647#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {18647#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18648#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,541 INFO L273 TraceCheckUtils]: 66: Hoare triple {18648#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18648#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,541 INFO L273 TraceCheckUtils]: 67: Hoare triple {18648#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18648#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,542 INFO L273 TraceCheckUtils]: 68: Hoare triple {18648#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18649#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,542 INFO L273 TraceCheckUtils]: 69: Hoare triple {18649#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18649#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,542 INFO L273 TraceCheckUtils]: 70: Hoare triple {18649#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18649#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,543 INFO L273 TraceCheckUtils]: 71: Hoare triple {18649#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18650#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,544 INFO L273 TraceCheckUtils]: 72: Hoare triple {18650#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18650#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,544 INFO L273 TraceCheckUtils]: 73: Hoare triple {18650#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18650#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,545 INFO L273 TraceCheckUtils]: 74: Hoare triple {18650#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18651#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,546 INFO L273 TraceCheckUtils]: 75: Hoare triple {18651#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18651#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,546 INFO L273 TraceCheckUtils]: 76: Hoare triple {18651#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18651#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,547 INFO L273 TraceCheckUtils]: 77: Hoare triple {18651#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18652#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,548 INFO L273 TraceCheckUtils]: 78: Hoare triple {18652#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18652#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,548 INFO L273 TraceCheckUtils]: 79: Hoare triple {18652#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18652#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,549 INFO L273 TraceCheckUtils]: 80: Hoare triple {18652#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18653#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {18653#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18653#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {18653#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18653#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,551 INFO L273 TraceCheckUtils]: 83: Hoare triple {18653#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18654#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,552 INFO L273 TraceCheckUtils]: 84: Hoare triple {18654#(<= main_~i~0 26)} assume !(~i~0 < 100000); {18627#false} is VALID [2018-11-23 11:59:29,552 INFO L273 TraceCheckUtils]: 85: Hoare triple {18627#false} havoc ~x~0; {18627#false} is VALID [2018-11-23 11:59:29,552 INFO L273 TraceCheckUtils]: 86: Hoare triple {18627#false} assume 0 != ~rv~0;~x~0 := 0; {18627#false} is VALID [2018-11-23 11:59:29,553 INFO L273 TraceCheckUtils]: 87: Hoare triple {18627#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {18627#false} is VALID [2018-11-23 11:59:29,553 INFO L256 TraceCheckUtils]: 88: Hoare triple {18627#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {18627#false} is VALID [2018-11-23 11:59:29,553 INFO L273 TraceCheckUtils]: 89: Hoare triple {18627#false} ~cond := #in~cond; {18627#false} is VALID [2018-11-23 11:59:29,553 INFO L273 TraceCheckUtils]: 90: Hoare triple {18627#false} assume 0 == ~cond; {18627#false} is VALID [2018-11-23 11:59:29,554 INFO L273 TraceCheckUtils]: 91: Hoare triple {18627#false} assume !false; {18627#false} is VALID [2018-11-23 11:59:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:29,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:29,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:29,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:29,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:29,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:29,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:29,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {18626#true} call ULTIMATE.init(); {18626#true} is VALID [2018-11-23 11:59:29,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {18626#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18626#true} is VALID [2018-11-23 11:59:29,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {18626#true} assume true; {18626#true} is VALID [2018-11-23 11:59:29,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18626#true} {18626#true} #77#return; {18626#true} is VALID [2018-11-23 11:59:29,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {18626#true} call #t~ret9 := main(); {18626#true} is VALID [2018-11-23 11:59:29,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {18626#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {18673#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:29,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {18673#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18673#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:29,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {18673#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18673#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:29,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {18673#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18629#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {18629#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18629#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {18629#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18629#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:29,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {18629#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18630#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {18630#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18630#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {18630#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18630#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:29,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {18630#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18631#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {18631#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18631#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {18631#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18631#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:29,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {18631#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18632#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {18632#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18632#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {18632#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18632#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:29,871 INFO L273 TraceCheckUtils]: 20: Hoare triple {18632#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {18633#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {18633#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18633#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:29,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {18633#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18634#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {18634#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18634#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {18634#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18634#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:29,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {18634#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18635#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {18635#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18635#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {18635#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18635#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:29,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {18635#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18636#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,877 INFO L273 TraceCheckUtils]: 30: Hoare triple {18636#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18636#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,878 INFO L273 TraceCheckUtils]: 31: Hoare triple {18636#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18636#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:29,878 INFO L273 TraceCheckUtils]: 32: Hoare triple {18636#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18637#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,879 INFO L273 TraceCheckUtils]: 33: Hoare triple {18637#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18637#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,879 INFO L273 TraceCheckUtils]: 34: Hoare triple {18637#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18637#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:29,880 INFO L273 TraceCheckUtils]: 35: Hoare triple {18637#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18638#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {18638#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18638#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {18638#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18638#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:29,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {18638#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18639#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,883 INFO L273 TraceCheckUtils]: 39: Hoare triple {18639#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18639#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,883 INFO L273 TraceCheckUtils]: 40: Hoare triple {18639#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18639#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:29,884 INFO L273 TraceCheckUtils]: 41: Hoare triple {18639#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18640#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {18640#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18640#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {18640#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18640#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:29,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {18640#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18641#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {18641#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18641#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {18641#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18641#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:29,888 INFO L273 TraceCheckUtils]: 47: Hoare triple {18641#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18642#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {18642#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18642#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,889 INFO L273 TraceCheckUtils]: 49: Hoare triple {18642#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18642#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:29,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {18642#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18643#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,890 INFO L273 TraceCheckUtils]: 51: Hoare triple {18643#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18643#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,890 INFO L273 TraceCheckUtils]: 52: Hoare triple {18643#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18643#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:29,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {18643#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18644#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,892 INFO L273 TraceCheckUtils]: 54: Hoare triple {18644#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18644#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,892 INFO L273 TraceCheckUtils]: 55: Hoare triple {18644#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18644#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:29,893 INFO L273 TraceCheckUtils]: 56: Hoare triple {18644#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18645#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,894 INFO L273 TraceCheckUtils]: 57: Hoare triple {18645#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18645#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,894 INFO L273 TraceCheckUtils]: 58: Hoare triple {18645#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18645#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:29,895 INFO L273 TraceCheckUtils]: 59: Hoare triple {18645#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18646#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,895 INFO L273 TraceCheckUtils]: 60: Hoare triple {18646#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18646#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,896 INFO L273 TraceCheckUtils]: 61: Hoare triple {18646#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18646#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:29,897 INFO L273 TraceCheckUtils]: 62: Hoare triple {18646#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18647#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,897 INFO L273 TraceCheckUtils]: 63: Hoare triple {18647#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18647#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,898 INFO L273 TraceCheckUtils]: 64: Hoare triple {18647#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18647#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:29,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {18647#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18648#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,899 INFO L273 TraceCheckUtils]: 66: Hoare triple {18648#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18648#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,900 INFO L273 TraceCheckUtils]: 67: Hoare triple {18648#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18648#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:29,900 INFO L273 TraceCheckUtils]: 68: Hoare triple {18648#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18649#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,901 INFO L273 TraceCheckUtils]: 69: Hoare triple {18649#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18649#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,901 INFO L273 TraceCheckUtils]: 70: Hoare triple {18649#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18649#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:29,902 INFO L273 TraceCheckUtils]: 71: Hoare triple {18649#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18650#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,903 INFO L273 TraceCheckUtils]: 72: Hoare triple {18650#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18650#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,903 INFO L273 TraceCheckUtils]: 73: Hoare triple {18650#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18650#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:29,904 INFO L273 TraceCheckUtils]: 74: Hoare triple {18650#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18651#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,905 INFO L273 TraceCheckUtils]: 75: Hoare triple {18651#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18651#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,905 INFO L273 TraceCheckUtils]: 76: Hoare triple {18651#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18651#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:29,906 INFO L273 TraceCheckUtils]: 77: Hoare triple {18651#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18652#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,907 INFO L273 TraceCheckUtils]: 78: Hoare triple {18652#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18652#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,907 INFO L273 TraceCheckUtils]: 79: Hoare triple {18652#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18652#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:29,908 INFO L273 TraceCheckUtils]: 80: Hoare triple {18652#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18653#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,908 INFO L273 TraceCheckUtils]: 81: Hoare triple {18653#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {18653#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,909 INFO L273 TraceCheckUtils]: 82: Hoare triple {18653#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {18653#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:29,910 INFO L273 TraceCheckUtils]: 83: Hoare triple {18653#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {18654#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:29,910 INFO L273 TraceCheckUtils]: 84: Hoare triple {18654#(<= main_~i~0 26)} assume !(~i~0 < 100000); {18627#false} is VALID [2018-11-23 11:59:29,911 INFO L273 TraceCheckUtils]: 85: Hoare triple {18627#false} havoc ~x~0; {18627#false} is VALID [2018-11-23 11:59:29,911 INFO L273 TraceCheckUtils]: 86: Hoare triple {18627#false} assume 0 != ~rv~0;~x~0 := 0; {18627#false} is VALID [2018-11-23 11:59:29,911 INFO L273 TraceCheckUtils]: 87: Hoare triple {18627#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {18627#false} is VALID [2018-11-23 11:59:29,911 INFO L256 TraceCheckUtils]: 88: Hoare triple {18627#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {18627#false} is VALID [2018-11-23 11:59:29,911 INFO L273 TraceCheckUtils]: 89: Hoare triple {18627#false} ~cond := #in~cond; {18627#false} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 90: Hoare triple {18627#false} assume 0 == ~cond; {18627#false} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 91: Hoare triple {18627#false} assume !false; {18627#false} is VALID [2018-11-23 11:59:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:29,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:29,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:59:29,937 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-23 11:59:29,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:29,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:59:30,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:30,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:59:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:59:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:30,032 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand 30 states. [2018-11-23 11:59:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,170 INFO L93 Difference]: Finished difference Result 210 states and 275 transitions. [2018-11-23 11:59:31,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:59:31,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-23 11:59:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 160 transitions. [2018-11-23 11:59:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 160 transitions. [2018-11-23 11:59:31,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 160 transitions. [2018-11-23 11:59:31,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:31,333 INFO L225 Difference]: With dead ends: 210 [2018-11-23 11:59:31,333 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 11:59:31,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 11:59:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2018-11-23 11:59:31,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:31,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 187 states. [2018-11-23 11:59:31,409 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 187 states. [2018-11-23 11:59:31,409 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 187 states. [2018-11-23 11:59:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,414 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2018-11-23 11:59:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 251 transitions. [2018-11-23 11:59:31,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:31,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:31,414 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 191 states. [2018-11-23 11:59:31,415 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 191 states. [2018-11-23 11:59:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,417 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2018-11-23 11:59:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 251 transitions. [2018-11-23 11:59:31,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:31,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:31,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:31,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-23 11:59:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 245 transitions. [2018-11-23 11:59:31,420 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 245 transitions. Word has length 92 [2018-11-23 11:59:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:31,421 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 245 transitions. [2018-11-23 11:59:31,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:59:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 245 transitions. [2018-11-23 11:59:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:59:31,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:31,422 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:31,422 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:31,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1099432928, now seen corresponding path program 27 times [2018-11-23 11:59:31,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:31,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:31,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:33,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {19843#true} call ULTIMATE.init(); {19843#true} is VALID [2018-11-23 11:59:33,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {19843#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19843#true} is VALID [2018-11-23 11:59:33,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {19843#true} assume true; {19843#true} is VALID [2018-11-23 11:59:33,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19843#true} {19843#true} #77#return; {19843#true} is VALID [2018-11-23 11:59:33,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {19843#true} call #t~ret9 := main(); {19843#true} is VALID [2018-11-23 11:59:33,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {19843#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {19845#(= main_~i~0 0)} is VALID [2018-11-23 11:59:33,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {19845#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19845#(= main_~i~0 0)} is VALID [2018-11-23 11:59:33,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {19845#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19845#(= main_~i~0 0)} is VALID [2018-11-23 11:59:33,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {19845#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19846#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:33,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {19846#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19846#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:33,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {19846#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19846#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:33,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {19846#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19847#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:33,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {19847#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19847#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:33,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {19847#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19847#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:33,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {19847#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19848#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:33,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {19848#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19848#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:33,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {19848#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19848#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:33,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {19848#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19849#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:33,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {19849#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19849#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:33,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {19849#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19849#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:33,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {19849#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19850#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:33,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {19850#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19850#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:33,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {19850#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19850#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:33,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {19850#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19851#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:33,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {19851#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19851#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:33,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {19851#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19851#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:33,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {19851#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19852#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:33,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {19852#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19852#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:33,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {19852#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19852#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:33,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {19852#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19853#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:33,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {19853#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19853#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:33,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {19853#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19853#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:33,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {19853#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19854#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:33,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {19854#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19854#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:33,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {19854#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19854#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:33,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {19854#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19855#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:33,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {19855#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19855#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:33,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {19855#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19855#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:33,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {19855#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19856#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:33,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {19856#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19856#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:33,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {19856#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19856#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:33,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {19856#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19857#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:33,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {19857#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19857#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:33,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {19857#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19857#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:33,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {19857#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19858#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:33,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {19858#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19858#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:33,827 INFO L273 TraceCheckUtils]: 46: Hoare triple {19858#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19858#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:33,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {19858#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19859#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:33,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {19859#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19859#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:33,829 INFO L273 TraceCheckUtils]: 49: Hoare triple {19859#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19859#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:33,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {19859#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19860#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:33,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {19860#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19860#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:33,831 INFO L273 TraceCheckUtils]: 52: Hoare triple {19860#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19860#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:33,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {19860#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19861#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:33,833 INFO L273 TraceCheckUtils]: 54: Hoare triple {19861#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19861#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:33,833 INFO L273 TraceCheckUtils]: 55: Hoare triple {19861#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19861#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:33,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {19861#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19862#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:33,835 INFO L273 TraceCheckUtils]: 57: Hoare triple {19862#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19862#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:33,835 INFO L273 TraceCheckUtils]: 58: Hoare triple {19862#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19862#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:33,836 INFO L273 TraceCheckUtils]: 59: Hoare triple {19862#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19863#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:33,836 INFO L273 TraceCheckUtils]: 60: Hoare triple {19863#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19863#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:33,837 INFO L273 TraceCheckUtils]: 61: Hoare triple {19863#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19863#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:33,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {19863#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19864#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:33,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {19864#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19864#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:33,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {19864#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19864#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:33,840 INFO L273 TraceCheckUtils]: 65: Hoare triple {19864#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19865#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:33,840 INFO L273 TraceCheckUtils]: 66: Hoare triple {19865#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19865#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:33,841 INFO L273 TraceCheckUtils]: 67: Hoare triple {19865#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19865#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:33,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {19865#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19866#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:33,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {19866#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19866#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:33,843 INFO L273 TraceCheckUtils]: 70: Hoare triple {19866#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19866#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:33,844 INFO L273 TraceCheckUtils]: 71: Hoare triple {19866#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19867#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:33,844 INFO L273 TraceCheckUtils]: 72: Hoare triple {19867#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19867#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:33,845 INFO L273 TraceCheckUtils]: 73: Hoare triple {19867#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19867#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:33,846 INFO L273 TraceCheckUtils]: 74: Hoare triple {19867#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19868#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:33,846 INFO L273 TraceCheckUtils]: 75: Hoare triple {19868#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19868#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:33,847 INFO L273 TraceCheckUtils]: 76: Hoare triple {19868#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19868#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:33,848 INFO L273 TraceCheckUtils]: 77: Hoare triple {19868#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19869#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:33,848 INFO L273 TraceCheckUtils]: 78: Hoare triple {19869#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19869#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:33,849 INFO L273 TraceCheckUtils]: 79: Hoare triple {19869#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19869#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:33,850 INFO L273 TraceCheckUtils]: 80: Hoare triple {19869#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19870#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:33,850 INFO L273 TraceCheckUtils]: 81: Hoare triple {19870#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19870#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:33,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {19870#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19870#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:33,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {19870#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19871#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:33,852 INFO L273 TraceCheckUtils]: 84: Hoare triple {19871#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19871#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:33,853 INFO L273 TraceCheckUtils]: 85: Hoare triple {19871#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19871#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:33,854 INFO L273 TraceCheckUtils]: 86: Hoare triple {19871#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19872#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:33,854 INFO L273 TraceCheckUtils]: 87: Hoare triple {19872#(<= main_~i~0 27)} assume !(~i~0 < 100000); {19844#false} is VALID [2018-11-23 11:59:33,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {19844#false} havoc ~x~0; {19844#false} is VALID [2018-11-23 11:59:33,855 INFO L273 TraceCheckUtils]: 89: Hoare triple {19844#false} assume 0 != ~rv~0;~x~0 := 0; {19844#false} is VALID [2018-11-23 11:59:33,855 INFO L273 TraceCheckUtils]: 90: Hoare triple {19844#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {19844#false} is VALID [2018-11-23 11:59:33,855 INFO L256 TraceCheckUtils]: 91: Hoare triple {19844#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {19844#false} is VALID [2018-11-23 11:59:33,856 INFO L273 TraceCheckUtils]: 92: Hoare triple {19844#false} ~cond := #in~cond; {19844#false} is VALID [2018-11-23 11:59:33,856 INFO L273 TraceCheckUtils]: 93: Hoare triple {19844#false} assume 0 == ~cond; {19844#false} is VALID [2018-11-23 11:59:33,856 INFO L273 TraceCheckUtils]: 94: Hoare triple {19844#false} assume !false; {19844#false} is VALID [2018-11-23 11:59:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:33,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:33,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:33,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:38,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 11:59:38,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:38,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:38,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {19843#true} call ULTIMATE.init(); {19843#true} is VALID [2018-11-23 11:59:38,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {19843#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19843#true} is VALID [2018-11-23 11:59:38,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {19843#true} assume true; {19843#true} is VALID [2018-11-23 11:59:38,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19843#true} {19843#true} #77#return; {19843#true} is VALID [2018-11-23 11:59:38,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {19843#true} call #t~ret9 := main(); {19843#true} is VALID [2018-11-23 11:59:38,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {19843#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {19891#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:38,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {19891#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19891#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:38,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {19891#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19891#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:38,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {19891#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19846#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:38,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {19846#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19846#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:38,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {19846#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19846#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:38,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {19846#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19847#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:38,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {19847#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19847#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:38,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {19847#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19847#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:38,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {19847#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19848#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:38,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {19848#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19848#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:38,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {19848#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19848#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:38,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {19848#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19849#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:38,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {19849#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19849#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:38,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {19849#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19849#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:38,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {19849#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19850#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:38,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {19850#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19850#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:38,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {19850#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19850#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:38,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {19850#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19851#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:38,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {19851#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19851#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:38,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {19851#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19851#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:38,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {19851#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19852#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:38,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {19852#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19852#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:38,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {19852#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19852#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:38,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {19852#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19853#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:38,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {19853#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19853#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:38,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {19853#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19853#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:38,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {19853#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19854#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:38,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {19854#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19854#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:38,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {19854#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19854#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:38,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {19854#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19855#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:38,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {19855#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19855#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:38,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {19855#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19855#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:38,533 INFO L273 TraceCheckUtils]: 38: Hoare triple {19855#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19856#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:38,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {19856#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19856#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:38,534 INFO L273 TraceCheckUtils]: 40: Hoare triple {19856#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19856#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:38,535 INFO L273 TraceCheckUtils]: 41: Hoare triple {19856#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19857#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:38,535 INFO L273 TraceCheckUtils]: 42: Hoare triple {19857#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19857#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:38,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {19857#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19857#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:38,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {19857#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19858#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:38,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {19858#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19858#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:38,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {19858#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19858#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:38,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {19858#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19859#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:38,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {19859#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19859#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:38,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {19859#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19859#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:38,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {19859#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19860#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:38,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {19860#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19860#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:38,541 INFO L273 TraceCheckUtils]: 52: Hoare triple {19860#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19860#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:38,542 INFO L273 TraceCheckUtils]: 53: Hoare triple {19860#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19861#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:38,543 INFO L273 TraceCheckUtils]: 54: Hoare triple {19861#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19861#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:38,543 INFO L273 TraceCheckUtils]: 55: Hoare triple {19861#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19861#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:38,544 INFO L273 TraceCheckUtils]: 56: Hoare triple {19861#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19862#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:38,545 INFO L273 TraceCheckUtils]: 57: Hoare triple {19862#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19862#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:38,545 INFO L273 TraceCheckUtils]: 58: Hoare triple {19862#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19862#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:38,546 INFO L273 TraceCheckUtils]: 59: Hoare triple {19862#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19863#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:38,547 INFO L273 TraceCheckUtils]: 60: Hoare triple {19863#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19863#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:38,547 INFO L273 TraceCheckUtils]: 61: Hoare triple {19863#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19863#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:38,548 INFO L273 TraceCheckUtils]: 62: Hoare triple {19863#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19864#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:38,549 INFO L273 TraceCheckUtils]: 63: Hoare triple {19864#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19864#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:38,549 INFO L273 TraceCheckUtils]: 64: Hoare triple {19864#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19864#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:38,550 INFO L273 TraceCheckUtils]: 65: Hoare triple {19864#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19865#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:38,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {19865#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19865#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:38,551 INFO L273 TraceCheckUtils]: 67: Hoare triple {19865#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19865#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:38,552 INFO L273 TraceCheckUtils]: 68: Hoare triple {19865#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19866#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:38,553 INFO L273 TraceCheckUtils]: 69: Hoare triple {19866#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19866#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:38,553 INFO L273 TraceCheckUtils]: 70: Hoare triple {19866#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19866#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:38,554 INFO L273 TraceCheckUtils]: 71: Hoare triple {19866#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19867#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:38,555 INFO L273 TraceCheckUtils]: 72: Hoare triple {19867#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19867#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:38,555 INFO L273 TraceCheckUtils]: 73: Hoare triple {19867#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19867#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:38,556 INFO L273 TraceCheckUtils]: 74: Hoare triple {19867#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19868#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:38,557 INFO L273 TraceCheckUtils]: 75: Hoare triple {19868#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19868#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:38,557 INFO L273 TraceCheckUtils]: 76: Hoare triple {19868#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19868#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:38,558 INFO L273 TraceCheckUtils]: 77: Hoare triple {19868#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19869#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:38,559 INFO L273 TraceCheckUtils]: 78: Hoare triple {19869#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19869#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:38,559 INFO L273 TraceCheckUtils]: 79: Hoare triple {19869#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19869#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:38,560 INFO L273 TraceCheckUtils]: 80: Hoare triple {19869#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19870#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:38,561 INFO L273 TraceCheckUtils]: 81: Hoare triple {19870#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19870#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:38,561 INFO L273 TraceCheckUtils]: 82: Hoare triple {19870#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19870#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:38,562 INFO L273 TraceCheckUtils]: 83: Hoare triple {19870#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19871#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:38,563 INFO L273 TraceCheckUtils]: 84: Hoare triple {19871#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19871#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:38,563 INFO L273 TraceCheckUtils]: 85: Hoare triple {19871#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {19871#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:38,564 INFO L273 TraceCheckUtils]: 86: Hoare triple {19871#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {19872#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:38,565 INFO L273 TraceCheckUtils]: 87: Hoare triple {19872#(<= main_~i~0 27)} assume !(~i~0 < 100000); {19844#false} is VALID [2018-11-23 11:59:38,565 INFO L273 TraceCheckUtils]: 88: Hoare triple {19844#false} havoc ~x~0; {19844#false} is VALID [2018-11-23 11:59:38,565 INFO L273 TraceCheckUtils]: 89: Hoare triple {19844#false} assume 0 != ~rv~0;~x~0 := 0; {19844#false} is VALID [2018-11-23 11:59:38,565 INFO L273 TraceCheckUtils]: 90: Hoare triple {19844#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {19844#false} is VALID [2018-11-23 11:59:38,566 INFO L256 TraceCheckUtils]: 91: Hoare triple {19844#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {19844#false} is VALID [2018-11-23 11:59:38,566 INFO L273 TraceCheckUtils]: 92: Hoare triple {19844#false} ~cond := #in~cond; {19844#false} is VALID [2018-11-23 11:59:38,566 INFO L273 TraceCheckUtils]: 93: Hoare triple {19844#false} assume 0 == ~cond; {19844#false} is VALID [2018-11-23 11:59:38,566 INFO L273 TraceCheckUtils]: 94: Hoare triple {19844#false} assume !false; {19844#false} is VALID [2018-11-23 11:59:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:38,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:38,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 11:59:38,596 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-11-23 11:59:38,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:38,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:59:38,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:38,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:59:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:59:38,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:38,790 INFO L87 Difference]: Start difference. First operand 187 states and 245 transitions. Second operand 31 states. [2018-11-23 11:59:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,027 INFO L93 Difference]: Finished difference Result 216 states and 283 transitions. [2018-11-23 11:59:40,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:59:40,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-11-23 11:59:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 164 transitions. [2018-11-23 11:59:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 164 transitions. [2018-11-23 11:59:40,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 164 transitions. [2018-11-23 11:59:40,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:40,211 INFO L225 Difference]: With dead ends: 216 [2018-11-23 11:59:40,212 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 11:59:40,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 11:59:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2018-11-23 11:59:40,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:40,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 193 states. [2018-11-23 11:59:40,374 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 193 states. [2018-11-23 11:59:40,374 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 193 states. [2018-11-23 11:59:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,378 INFO L93 Difference]: Finished difference Result 197 states and 259 transitions. [2018-11-23 11:59:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 259 transitions. [2018-11-23 11:59:40,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:40,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:40,379 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 197 states. [2018-11-23 11:59:40,379 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 197 states. [2018-11-23 11:59:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,383 INFO L93 Difference]: Finished difference Result 197 states and 259 transitions. [2018-11-23 11:59:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 259 transitions. [2018-11-23 11:59:40,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:40,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:40,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:40,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-23 11:59:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 253 transitions. [2018-11-23 11:59:40,387 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 253 transitions. Word has length 95 [2018-11-23 11:59:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:40,388 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 253 transitions. [2018-11-23 11:59:40,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:59:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 253 transitions. [2018-11-23 11:59:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 11:59:40,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:40,389 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:40,389 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:40,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash 327360224, now seen corresponding path program 28 times [2018-11-23 11:59:40,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:40,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:40,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:40,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:40,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:40,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {21098#true} call ULTIMATE.init(); {21098#true} is VALID [2018-11-23 11:59:40,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {21098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21098#true} is VALID [2018-11-23 11:59:40,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {21098#true} assume true; {21098#true} is VALID [2018-11-23 11:59:40,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21098#true} {21098#true} #77#return; {21098#true} is VALID [2018-11-23 11:59:40,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {21098#true} call #t~ret9 := main(); {21098#true} is VALID [2018-11-23 11:59:40,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {21098#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {21100#(= main_~i~0 0)} is VALID [2018-11-23 11:59:40,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {21100#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21100#(= main_~i~0 0)} is VALID [2018-11-23 11:59:40,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {21100#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21100#(= main_~i~0 0)} is VALID [2018-11-23 11:59:40,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {21100#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21101#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {21101#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21101#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {21101#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21101#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:40,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {21101#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21102#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {21102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21102#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {21102#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21102#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {21102#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21103#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {21103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21103#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {21103#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21103#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {21103#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21104#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {21104#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21104#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {21104#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21104#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {21104#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21105#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {21105#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21105#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {21105#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21105#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {21105#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21106#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {21106#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {21106#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21106#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {21106#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21107#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {21107#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {21107#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21107#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {21107#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {21108#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {21108#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {21108#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21109#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {21109#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {21109#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21109#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {21109#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21110#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {21110#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {21110#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21110#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {21110#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21111#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,959 INFO L273 TraceCheckUtils]: 39: Hoare triple {21111#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21111#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {21111#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21111#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {21111#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21112#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,961 INFO L273 TraceCheckUtils]: 42: Hoare triple {21112#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21112#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {21112#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21112#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {21112#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21113#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {21113#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21113#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {21113#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21113#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,964 INFO L273 TraceCheckUtils]: 47: Hoare triple {21113#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21114#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {21114#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21114#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {21114#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21114#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {21114#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21115#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {21115#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21115#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {21115#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21115#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {21115#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21116#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {21116#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21116#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,969 INFO L273 TraceCheckUtils]: 55: Hoare triple {21116#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21116#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,970 INFO L273 TraceCheckUtils]: 56: Hoare triple {21116#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21117#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,970 INFO L273 TraceCheckUtils]: 57: Hoare triple {21117#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21117#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,971 INFO L273 TraceCheckUtils]: 58: Hoare triple {21117#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21117#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,977 INFO L273 TraceCheckUtils]: 59: Hoare triple {21117#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21118#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,978 INFO L273 TraceCheckUtils]: 60: Hoare triple {21118#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21118#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,978 INFO L273 TraceCheckUtils]: 61: Hoare triple {21118#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21118#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,978 INFO L273 TraceCheckUtils]: 62: Hoare triple {21118#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21119#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,979 INFO L273 TraceCheckUtils]: 63: Hoare triple {21119#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21119#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,979 INFO L273 TraceCheckUtils]: 64: Hoare triple {21119#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21119#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,980 INFO L273 TraceCheckUtils]: 65: Hoare triple {21119#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21120#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,980 INFO L273 TraceCheckUtils]: 66: Hoare triple {21120#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21120#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,980 INFO L273 TraceCheckUtils]: 67: Hoare triple {21120#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21120#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,981 INFO L273 TraceCheckUtils]: 68: Hoare triple {21120#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21121#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,981 INFO L273 TraceCheckUtils]: 69: Hoare triple {21121#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21121#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,981 INFO L273 TraceCheckUtils]: 70: Hoare triple {21121#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21121#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,982 INFO L273 TraceCheckUtils]: 71: Hoare triple {21121#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21122#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,982 INFO L273 TraceCheckUtils]: 72: Hoare triple {21122#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21122#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,983 INFO L273 TraceCheckUtils]: 73: Hoare triple {21122#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21122#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,984 INFO L273 TraceCheckUtils]: 74: Hoare triple {21122#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21123#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,984 INFO L273 TraceCheckUtils]: 75: Hoare triple {21123#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21123#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,985 INFO L273 TraceCheckUtils]: 76: Hoare triple {21123#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21123#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,986 INFO L273 TraceCheckUtils]: 77: Hoare triple {21123#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21124#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,986 INFO L273 TraceCheckUtils]: 78: Hoare triple {21124#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21124#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,987 INFO L273 TraceCheckUtils]: 79: Hoare triple {21124#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21124#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,987 INFO L273 TraceCheckUtils]: 80: Hoare triple {21124#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21125#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,988 INFO L273 TraceCheckUtils]: 81: Hoare triple {21125#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21125#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,988 INFO L273 TraceCheckUtils]: 82: Hoare triple {21125#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21125#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,989 INFO L273 TraceCheckUtils]: 83: Hoare triple {21125#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21126#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,990 INFO L273 TraceCheckUtils]: 84: Hoare triple {21126#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21126#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,990 INFO L273 TraceCheckUtils]: 85: Hoare triple {21126#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21126#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,991 INFO L273 TraceCheckUtils]: 86: Hoare triple {21126#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21127#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,992 INFO L273 TraceCheckUtils]: 87: Hoare triple {21127#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21127#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,992 INFO L273 TraceCheckUtils]: 88: Hoare triple {21127#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21127#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,993 INFO L273 TraceCheckUtils]: 89: Hoare triple {21127#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21128#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,994 INFO L273 TraceCheckUtils]: 90: Hoare triple {21128#(<= main_~i~0 28)} assume !(~i~0 < 100000); {21099#false} is VALID [2018-11-23 11:59:40,994 INFO L273 TraceCheckUtils]: 91: Hoare triple {21099#false} havoc ~x~0; {21099#false} is VALID [2018-11-23 11:59:40,994 INFO L273 TraceCheckUtils]: 92: Hoare triple {21099#false} assume 0 != ~rv~0;~x~0 := 0; {21099#false} is VALID [2018-11-23 11:59:40,994 INFO L273 TraceCheckUtils]: 93: Hoare triple {21099#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {21099#false} is VALID [2018-11-23 11:59:40,994 INFO L256 TraceCheckUtils]: 94: Hoare triple {21099#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {21099#false} is VALID [2018-11-23 11:59:40,995 INFO L273 TraceCheckUtils]: 95: Hoare triple {21099#false} ~cond := #in~cond; {21099#false} is VALID [2018-11-23 11:59:40,995 INFO L273 TraceCheckUtils]: 96: Hoare triple {21099#false} assume 0 == ~cond; {21099#false} is VALID [2018-11-23 11:59:40,995 INFO L273 TraceCheckUtils]: 97: Hoare triple {21099#false} assume !false; {21099#false} is VALID [2018-11-23 11:59:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:41,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:41,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:41,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:41,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:41,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:41,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:42,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {21098#true} call ULTIMATE.init(); {21098#true} is VALID [2018-11-23 11:59:42,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {21098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21098#true} is VALID [2018-11-23 11:59:42,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {21098#true} assume true; {21098#true} is VALID [2018-11-23 11:59:42,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21098#true} {21098#true} #77#return; {21098#true} is VALID [2018-11-23 11:59:42,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {21098#true} call #t~ret9 := main(); {21098#true} is VALID [2018-11-23 11:59:42,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {21098#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {21147#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:42,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {21147#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:42,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {21147#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21147#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:42,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {21147#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21101#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:42,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {21101#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21101#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:42,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {21101#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21101#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:42,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {21101#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21102#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:42,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {21102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21102#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:42,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {21102#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21102#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:42,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {21102#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21103#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:42,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {21103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21103#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:42,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {21103#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21103#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:42,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {21103#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21104#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:42,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {21104#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21104#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:42,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {21104#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21104#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:42,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {21104#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21105#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:42,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {21105#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21105#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:42,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {21105#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21105#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:42,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {21105#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21106#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:42,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {21106#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:42,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {21106#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21106#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:42,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {21106#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21107#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:42,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {21107#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:42,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {21107#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21107#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:42,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {21107#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:42,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {21108#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:42,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {21108#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:42,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {21108#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21109#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:42,628 INFO L273 TraceCheckUtils]: 33: Hoare triple {21109#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:42,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {21109#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21109#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:42,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {21109#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21110#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:42,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {21110#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:42,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {21110#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21110#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:42,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {21110#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21111#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:42,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {21111#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21111#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:42,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {21111#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21111#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:42,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {21111#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21112#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:42,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {21112#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21112#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:42,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {21112#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21112#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:42,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {21112#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21113#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:42,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {21113#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21113#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:42,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {21113#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21113#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:42,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {21113#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21114#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:42,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {21114#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21114#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:42,695 INFO L273 TraceCheckUtils]: 49: Hoare triple {21114#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21114#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:42,709 INFO L273 TraceCheckUtils]: 50: Hoare triple {21114#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21115#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:42,710 INFO L273 TraceCheckUtils]: 51: Hoare triple {21115#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21115#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:42,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {21115#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21115#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:42,711 INFO L273 TraceCheckUtils]: 53: Hoare triple {21115#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21116#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:42,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {21116#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21116#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:42,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {21116#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21116#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:42,712 INFO L273 TraceCheckUtils]: 56: Hoare triple {21116#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21117#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:42,712 INFO L273 TraceCheckUtils]: 57: Hoare triple {21117#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21117#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:42,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {21117#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21117#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:42,713 INFO L273 TraceCheckUtils]: 59: Hoare triple {21117#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21118#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:42,713 INFO L273 TraceCheckUtils]: 60: Hoare triple {21118#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21118#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:42,714 INFO L273 TraceCheckUtils]: 61: Hoare triple {21118#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21118#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:42,715 INFO L273 TraceCheckUtils]: 62: Hoare triple {21118#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21119#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:42,715 INFO L273 TraceCheckUtils]: 63: Hoare triple {21119#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21119#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:42,716 INFO L273 TraceCheckUtils]: 64: Hoare triple {21119#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21119#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:42,716 INFO L273 TraceCheckUtils]: 65: Hoare triple {21119#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21120#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:42,717 INFO L273 TraceCheckUtils]: 66: Hoare triple {21120#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21120#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:42,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {21120#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21120#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:42,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {21120#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21121#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:42,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {21121#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21121#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:42,719 INFO L273 TraceCheckUtils]: 70: Hoare triple {21121#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21121#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:42,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {21121#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21122#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:42,721 INFO L273 TraceCheckUtils]: 72: Hoare triple {21122#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21122#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:42,721 INFO L273 TraceCheckUtils]: 73: Hoare triple {21122#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21122#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:42,722 INFO L273 TraceCheckUtils]: 74: Hoare triple {21122#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21123#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:42,723 INFO L273 TraceCheckUtils]: 75: Hoare triple {21123#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21123#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:42,723 INFO L273 TraceCheckUtils]: 76: Hoare triple {21123#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21123#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:42,724 INFO L273 TraceCheckUtils]: 77: Hoare triple {21123#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21124#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:42,725 INFO L273 TraceCheckUtils]: 78: Hoare triple {21124#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21124#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:42,725 INFO L273 TraceCheckUtils]: 79: Hoare triple {21124#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21124#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:42,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {21124#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21125#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:42,727 INFO L273 TraceCheckUtils]: 81: Hoare triple {21125#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21125#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:42,727 INFO L273 TraceCheckUtils]: 82: Hoare triple {21125#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21125#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:42,728 INFO L273 TraceCheckUtils]: 83: Hoare triple {21125#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21126#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:42,729 INFO L273 TraceCheckUtils]: 84: Hoare triple {21126#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21126#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:42,729 INFO L273 TraceCheckUtils]: 85: Hoare triple {21126#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21126#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:42,730 INFO L273 TraceCheckUtils]: 86: Hoare triple {21126#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21127#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:42,731 INFO L273 TraceCheckUtils]: 87: Hoare triple {21127#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21127#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:42,731 INFO L273 TraceCheckUtils]: 88: Hoare triple {21127#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {21127#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:42,732 INFO L273 TraceCheckUtils]: 89: Hoare triple {21127#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {21128#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:42,733 INFO L273 TraceCheckUtils]: 90: Hoare triple {21128#(<= main_~i~0 28)} assume !(~i~0 < 100000); {21099#false} is VALID [2018-11-23 11:59:42,733 INFO L273 TraceCheckUtils]: 91: Hoare triple {21099#false} havoc ~x~0; {21099#false} is VALID [2018-11-23 11:59:42,733 INFO L273 TraceCheckUtils]: 92: Hoare triple {21099#false} assume 0 != ~rv~0;~x~0 := 0; {21099#false} is VALID [2018-11-23 11:59:42,733 INFO L273 TraceCheckUtils]: 93: Hoare triple {21099#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {21099#false} is VALID [2018-11-23 11:59:42,733 INFO L256 TraceCheckUtils]: 94: Hoare triple {21099#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {21099#false} is VALID [2018-11-23 11:59:42,734 INFO L273 TraceCheckUtils]: 95: Hoare triple {21099#false} ~cond := #in~cond; {21099#false} is VALID [2018-11-23 11:59:42,734 INFO L273 TraceCheckUtils]: 96: Hoare triple {21099#false} assume 0 == ~cond; {21099#false} is VALID [2018-11-23 11:59:42,734 INFO L273 TraceCheckUtils]: 97: Hoare triple {21099#false} assume !false; {21099#false} is VALID [2018-11-23 11:59:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:42,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:42,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:59:42,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-11-23 11:59:42,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:42,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:59:42,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:42,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:59:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:59:42,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:42,914 INFO L87 Difference]: Start difference. First operand 193 states and 253 transitions. Second operand 32 states. [2018-11-23 11:59:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:43,396 INFO L93 Difference]: Finished difference Result 222 states and 291 transitions. [2018-11-23 11:59:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:59:43,396 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-11-23 11:59:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 168 transitions. [2018-11-23 11:59:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 168 transitions. [2018-11-23 11:59:43,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 168 transitions. [2018-11-23 11:59:43,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:43,555 INFO L225 Difference]: With dead ends: 222 [2018-11-23 11:59:43,555 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 11:59:43,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 11:59:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-11-23 11:59:43,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:43,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 199 states. [2018-11-23 11:59:43,625 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 199 states. [2018-11-23 11:59:43,625 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 199 states. [2018-11-23 11:59:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:43,630 INFO L93 Difference]: Finished difference Result 203 states and 267 transitions. [2018-11-23 11:59:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 267 transitions. [2018-11-23 11:59:43,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:43,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:43,631 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 203 states. [2018-11-23 11:59:43,631 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 203 states. [2018-11-23 11:59:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:43,635 INFO L93 Difference]: Finished difference Result 203 states and 267 transitions. [2018-11-23 11:59:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 267 transitions. [2018-11-23 11:59:43,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:43,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:43,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:43,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 11:59:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 261 transitions. [2018-11-23 11:59:43,640 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 261 transitions. Word has length 98 [2018-11-23 11:59:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:43,640 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 261 transitions. [2018-11-23 11:59:43,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:59:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 261 transitions. [2018-11-23 11:59:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 11:59:43,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:43,641 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:43,641 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:43,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1369177056, now seen corresponding path program 29 times [2018-11-23 11:59:43,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:43,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:43,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:43,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:44,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {22391#true} call ULTIMATE.init(); {22391#true} is VALID [2018-11-23 11:59:44,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {22391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22391#true} is VALID [2018-11-23 11:59:44,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {22391#true} assume true; {22391#true} is VALID [2018-11-23 11:59:44,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22391#true} {22391#true} #77#return; {22391#true} is VALID [2018-11-23 11:59:44,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {22391#true} call #t~ret9 := main(); {22391#true} is VALID [2018-11-23 11:59:44,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {22391#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {22393#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {22393#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22393#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {22393#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22393#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {22393#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22394#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:44,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {22394#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22394#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:44,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {22394#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22394#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:44,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {22394#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22395#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {22395#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22395#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {22395#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22395#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {22395#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22396#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {22396#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22396#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {22396#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22396#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {22396#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22397#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {22397#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22397#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {22397#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22397#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {22397#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22398#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {22398#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22398#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {22398#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22398#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {22398#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22399#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {22399#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22399#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {22399#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22399#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {22399#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22400#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,619 INFO L273 TraceCheckUtils]: 27: Hoare triple {22400#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22400#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,627 INFO L273 TraceCheckUtils]: 28: Hoare triple {22400#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22400#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {22400#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22401#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {22401#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22401#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {22401#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22401#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {22401#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22402#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {22402#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22402#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {22402#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22402#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {22402#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22403#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:44,638 INFO L273 TraceCheckUtils]: 36: Hoare triple {22403#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22403#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:44,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {22403#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22403#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:44,639 INFO L273 TraceCheckUtils]: 38: Hoare triple {22403#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22404#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:44,640 INFO L273 TraceCheckUtils]: 39: Hoare triple {22404#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22404#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:44,640 INFO L273 TraceCheckUtils]: 40: Hoare triple {22404#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22404#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:44,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {22404#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22405#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:44,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {22405#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22405#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:44,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {22405#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22405#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:44,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {22405#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22406#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:44,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {22406#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22406#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:44,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {22406#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22406#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:44,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {22406#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22407#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:44,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {22407#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22407#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:44,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {22407#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22407#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:44,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {22407#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22408#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:44,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {22408#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22408#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:44,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {22408#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22408#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:44,675 INFO L273 TraceCheckUtils]: 53: Hoare triple {22408#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22409#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:44,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {22409#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22409#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:44,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {22409#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22409#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:44,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {22409#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22410#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:44,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {22410#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22410#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:44,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {22410#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22410#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:44,685 INFO L273 TraceCheckUtils]: 59: Hoare triple {22410#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22411#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:44,685 INFO L273 TraceCheckUtils]: 60: Hoare triple {22411#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22411#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:44,685 INFO L273 TraceCheckUtils]: 61: Hoare triple {22411#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22411#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:44,686 INFO L273 TraceCheckUtils]: 62: Hoare triple {22411#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22412#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:44,686 INFO L273 TraceCheckUtils]: 63: Hoare triple {22412#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22412#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:44,687 INFO L273 TraceCheckUtils]: 64: Hoare triple {22412#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22412#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:44,687 INFO L273 TraceCheckUtils]: 65: Hoare triple {22412#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22413#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:44,688 INFO L273 TraceCheckUtils]: 66: Hoare triple {22413#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22413#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:44,688 INFO L273 TraceCheckUtils]: 67: Hoare triple {22413#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22413#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:44,689 INFO L273 TraceCheckUtils]: 68: Hoare triple {22413#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22414#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:44,690 INFO L273 TraceCheckUtils]: 69: Hoare triple {22414#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22414#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:44,690 INFO L273 TraceCheckUtils]: 70: Hoare triple {22414#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22414#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:44,691 INFO L273 TraceCheckUtils]: 71: Hoare triple {22414#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22415#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:44,691 INFO L273 TraceCheckUtils]: 72: Hoare triple {22415#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22415#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:44,692 INFO L273 TraceCheckUtils]: 73: Hoare triple {22415#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22415#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:44,693 INFO L273 TraceCheckUtils]: 74: Hoare triple {22415#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22416#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:44,693 INFO L273 TraceCheckUtils]: 75: Hoare triple {22416#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22416#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:44,694 INFO L273 TraceCheckUtils]: 76: Hoare triple {22416#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22416#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:44,694 INFO L273 TraceCheckUtils]: 77: Hoare triple {22416#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22417#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:44,695 INFO L273 TraceCheckUtils]: 78: Hoare triple {22417#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22417#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:44,695 INFO L273 TraceCheckUtils]: 79: Hoare triple {22417#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22417#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:44,696 INFO L273 TraceCheckUtils]: 80: Hoare triple {22417#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22418#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:44,697 INFO L273 TraceCheckUtils]: 81: Hoare triple {22418#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22418#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:44,697 INFO L273 TraceCheckUtils]: 82: Hoare triple {22418#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22418#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:44,698 INFO L273 TraceCheckUtils]: 83: Hoare triple {22418#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22419#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:44,699 INFO L273 TraceCheckUtils]: 84: Hoare triple {22419#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22419#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:44,699 INFO L273 TraceCheckUtils]: 85: Hoare triple {22419#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22419#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:44,700 INFO L273 TraceCheckUtils]: 86: Hoare triple {22419#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22420#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:44,700 INFO L273 TraceCheckUtils]: 87: Hoare triple {22420#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22420#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:44,701 INFO L273 TraceCheckUtils]: 88: Hoare triple {22420#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22420#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:44,702 INFO L273 TraceCheckUtils]: 89: Hoare triple {22420#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22421#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:44,702 INFO L273 TraceCheckUtils]: 90: Hoare triple {22421#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22421#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:44,703 INFO L273 TraceCheckUtils]: 91: Hoare triple {22421#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22421#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:44,704 INFO L273 TraceCheckUtils]: 92: Hoare triple {22421#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22422#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:44,704 INFO L273 TraceCheckUtils]: 93: Hoare triple {22422#(<= main_~i~0 29)} assume !(~i~0 < 100000); {22392#false} is VALID [2018-11-23 11:59:44,704 INFO L273 TraceCheckUtils]: 94: Hoare triple {22392#false} havoc ~x~0; {22392#false} is VALID [2018-11-23 11:59:44,705 INFO L273 TraceCheckUtils]: 95: Hoare triple {22392#false} assume 0 != ~rv~0;~x~0 := 0; {22392#false} is VALID [2018-11-23 11:59:44,705 INFO L273 TraceCheckUtils]: 96: Hoare triple {22392#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {22392#false} is VALID [2018-11-23 11:59:44,705 INFO L256 TraceCheckUtils]: 97: Hoare triple {22392#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {22392#false} is VALID [2018-11-23 11:59:44,705 INFO L273 TraceCheckUtils]: 98: Hoare triple {22392#false} ~cond := #in~cond; {22392#false} is VALID [2018-11-23 11:59:44,705 INFO L273 TraceCheckUtils]: 99: Hoare triple {22392#false} assume 0 == ~cond; {22392#false} is VALID [2018-11-23 11:59:44,706 INFO L273 TraceCheckUtils]: 100: Hoare triple {22392#false} assume !false; {22392#false} is VALID [2018-11-23 11:59:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:44,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:44,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:45,760 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 11:59:45,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:45,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:46,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {22391#true} call ULTIMATE.init(); {22391#true} is VALID [2018-11-23 11:59:46,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {22391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22391#true} is VALID [2018-11-23 11:59:46,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {22391#true} assume true; {22391#true} is VALID [2018-11-23 11:59:46,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22391#true} {22391#true} #77#return; {22391#true} is VALID [2018-11-23 11:59:46,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {22391#true} call #t~ret9 := main(); {22391#true} is VALID [2018-11-23 11:59:46,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {22391#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {22441#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:46,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {22441#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22441#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:46,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {22441#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22441#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:46,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {22441#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22394#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:46,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {22394#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22394#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:46,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {22394#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22394#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:46,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {22394#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22395#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:46,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {22395#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22395#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:46,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {22395#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22395#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:46,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {22395#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22396#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:46,023 INFO L273 TraceCheckUtils]: 15: Hoare triple {22396#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22396#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:46,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {22396#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22396#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:46,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {22396#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22397#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:46,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {22397#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22397#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:46,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {22397#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22397#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:46,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {22397#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22398#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:46,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {22398#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22398#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:46,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {22398#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22398#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:46,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {22398#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22399#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:46,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {22399#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22399#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:46,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {22399#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22399#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:46,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {22399#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22400#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:46,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {22400#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22400#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:46,031 INFO L273 TraceCheckUtils]: 28: Hoare triple {22400#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22400#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:46,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {22400#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22401#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:46,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {22401#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22401#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:46,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {22401#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22401#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:46,034 INFO L273 TraceCheckUtils]: 32: Hoare triple {22401#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22402#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:46,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {22402#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22402#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:46,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {22402#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22402#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:46,036 INFO L273 TraceCheckUtils]: 35: Hoare triple {22402#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22403#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:46,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {22403#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22403#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:46,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {22403#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22403#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:46,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {22403#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22404#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:46,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {22404#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22404#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:46,039 INFO L273 TraceCheckUtils]: 40: Hoare triple {22404#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22404#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:46,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {22404#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22405#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:46,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {22405#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22405#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:46,041 INFO L273 TraceCheckUtils]: 43: Hoare triple {22405#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22405#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:46,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {22405#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22406#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:46,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {22406#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22406#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:46,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {22406#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22406#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:46,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {22406#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22407#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:46,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {22407#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22407#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:46,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {22407#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22407#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:46,045 INFO L273 TraceCheckUtils]: 50: Hoare triple {22407#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22408#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:46,046 INFO L273 TraceCheckUtils]: 51: Hoare triple {22408#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22408#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:46,046 INFO L273 TraceCheckUtils]: 52: Hoare triple {22408#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22408#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:46,047 INFO L273 TraceCheckUtils]: 53: Hoare triple {22408#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22409#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:46,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {22409#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22409#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:46,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {22409#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22409#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:46,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {22409#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22410#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:46,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {22410#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22410#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:46,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {22410#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22410#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:46,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {22410#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22411#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:46,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {22411#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22411#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:46,052 INFO L273 TraceCheckUtils]: 61: Hoare triple {22411#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22411#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:46,053 INFO L273 TraceCheckUtils]: 62: Hoare triple {22411#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22412#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:46,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {22412#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22412#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:46,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {22412#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22412#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:46,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {22412#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22413#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:46,056 INFO L273 TraceCheckUtils]: 66: Hoare triple {22413#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22413#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:46,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {22413#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22413#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:46,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {22413#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22414#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:46,058 INFO L273 TraceCheckUtils]: 69: Hoare triple {22414#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22414#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:46,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {22414#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22414#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:46,059 INFO L273 TraceCheckUtils]: 71: Hoare triple {22414#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22415#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:46,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {22415#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22415#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:46,060 INFO L273 TraceCheckUtils]: 73: Hoare triple {22415#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22415#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:46,061 INFO L273 TraceCheckUtils]: 74: Hoare triple {22415#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22416#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:46,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {22416#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22416#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:46,062 INFO L273 TraceCheckUtils]: 76: Hoare triple {22416#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22416#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:46,063 INFO L273 TraceCheckUtils]: 77: Hoare triple {22416#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22417#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:46,063 INFO L273 TraceCheckUtils]: 78: Hoare triple {22417#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22417#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:46,064 INFO L273 TraceCheckUtils]: 79: Hoare triple {22417#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22417#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:46,065 INFO L273 TraceCheckUtils]: 80: Hoare triple {22417#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22418#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:46,065 INFO L273 TraceCheckUtils]: 81: Hoare triple {22418#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22418#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:46,066 INFO L273 TraceCheckUtils]: 82: Hoare triple {22418#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22418#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:46,067 INFO L273 TraceCheckUtils]: 83: Hoare triple {22418#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22419#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:46,067 INFO L273 TraceCheckUtils]: 84: Hoare triple {22419#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22419#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:46,068 INFO L273 TraceCheckUtils]: 85: Hoare triple {22419#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22419#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:46,069 INFO L273 TraceCheckUtils]: 86: Hoare triple {22419#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22420#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:46,069 INFO L273 TraceCheckUtils]: 87: Hoare triple {22420#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22420#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:46,070 INFO L273 TraceCheckUtils]: 88: Hoare triple {22420#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22420#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:46,070 INFO L273 TraceCheckUtils]: 89: Hoare triple {22420#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22421#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:46,071 INFO L273 TraceCheckUtils]: 90: Hoare triple {22421#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22421#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:46,072 INFO L273 TraceCheckUtils]: 91: Hoare triple {22421#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {22421#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:46,072 INFO L273 TraceCheckUtils]: 92: Hoare triple {22421#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {22422#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:46,073 INFO L273 TraceCheckUtils]: 93: Hoare triple {22422#(<= main_~i~0 29)} assume !(~i~0 < 100000); {22392#false} is VALID [2018-11-23 11:59:46,073 INFO L273 TraceCheckUtils]: 94: Hoare triple {22392#false} havoc ~x~0; {22392#false} is VALID [2018-11-23 11:59:46,074 INFO L273 TraceCheckUtils]: 95: Hoare triple {22392#false} assume 0 != ~rv~0;~x~0 := 0; {22392#false} is VALID [2018-11-23 11:59:46,074 INFO L273 TraceCheckUtils]: 96: Hoare triple {22392#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {22392#false} is VALID [2018-11-23 11:59:46,074 INFO L256 TraceCheckUtils]: 97: Hoare triple {22392#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {22392#false} is VALID [2018-11-23 11:59:46,074 INFO L273 TraceCheckUtils]: 98: Hoare triple {22392#false} ~cond := #in~cond; {22392#false} is VALID [2018-11-23 11:59:46,074 INFO L273 TraceCheckUtils]: 99: Hoare triple {22392#false} assume 0 == ~cond; {22392#false} is VALID [2018-11-23 11:59:46,074 INFO L273 TraceCheckUtils]: 100: Hoare triple {22392#false} assume !false; {22392#false} is VALID [2018-11-23 11:59:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:46,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:46,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 11:59:46,103 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2018-11-23 11:59:46,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:46,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:59:46,208 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 11:59:46,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:59:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:59:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:59:46,210 INFO L87 Difference]: Start difference. First operand 199 states and 261 transitions. Second operand 33 states. [2018-11-23 11:59:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:46,938 INFO L93 Difference]: Finished difference Result 228 states and 299 transitions. [2018-11-23 11:59:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:59:46,938 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2018-11-23 11:59:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:59:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 172 transitions. [2018-11-23 11:59:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:59:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 172 transitions. [2018-11-23 11:59:46,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 172 transitions. [2018-11-23 11:59:47,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:47,105 INFO L225 Difference]: With dead ends: 228 [2018-11-23 11:59:47,106 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 11:59:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:59:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 11:59:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-11-23 11:59:47,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:47,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 205 states. [2018-11-23 11:59:47,181 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 205 states. [2018-11-23 11:59:47,181 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 205 states. [2018-11-23 11:59:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:47,186 INFO L93 Difference]: Finished difference Result 209 states and 275 transitions. [2018-11-23 11:59:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 275 transitions. [2018-11-23 11:59:47,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:47,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:47,187 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 209 states. [2018-11-23 11:59:47,187 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 209 states. [2018-11-23 11:59:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:47,190 INFO L93 Difference]: Finished difference Result 209 states and 275 transitions. [2018-11-23 11:59:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 275 transitions. [2018-11-23 11:59:47,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:47,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:47,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:47,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-23 11:59:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 269 transitions. [2018-11-23 11:59:47,194 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 269 transitions. Word has length 101 [2018-11-23 11:59:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:47,194 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 269 transitions. [2018-11-23 11:59:47,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:59:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 269 transitions. [2018-11-23 11:59:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 11:59:47,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:47,195 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:47,195 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:47,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash 263853792, now seen corresponding path program 30 times [2018-11-23 11:59:47,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:47,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:47,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {23722#true} call ULTIMATE.init(); {23722#true} is VALID [2018-11-23 11:59:47,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {23722#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23722#true} is VALID [2018-11-23 11:59:47,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {23722#true} assume true; {23722#true} is VALID [2018-11-23 11:59:47,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23722#true} {23722#true} #77#return; {23722#true} is VALID [2018-11-23 11:59:47,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {23722#true} call #t~ret9 := main(); {23722#true} is VALID [2018-11-23 11:59:47,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {23722#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {23724#(= main_~i~0 0)} is VALID [2018-11-23 11:59:47,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {23724#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23724#(= main_~i~0 0)} is VALID [2018-11-23 11:59:47,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {23724#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23724#(= main_~i~0 0)} is VALID [2018-11-23 11:59:47,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {23724#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23725#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {23725#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23725#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {23725#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23725#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:47,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {23725#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23726#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {23726#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23726#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {23726#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23726#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {23726#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23727#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {23727#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23727#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,848 INFO L273 TraceCheckUtils]: 16: Hoare triple {23727#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23727#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {23727#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23728#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {23728#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23728#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {23728#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23728#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {23728#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23729#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {23729#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23729#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {23729#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23729#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {23729#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23730#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,853 INFO L273 TraceCheckUtils]: 24: Hoare triple {23730#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23730#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {23730#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23730#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {23730#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23731#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {23731#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23731#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {23731#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23731#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,856 INFO L273 TraceCheckUtils]: 29: Hoare triple {23731#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23732#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,856 INFO L273 TraceCheckUtils]: 30: Hoare triple {23732#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23732#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {23732#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23732#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {23732#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23733#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {23733#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23733#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {23733#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23733#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {23733#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23734#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {23734#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23734#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 37: Hoare triple {23734#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23734#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {23734#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23735#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {23735#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23735#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,862 INFO L273 TraceCheckUtils]: 40: Hoare triple {23735#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23735#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,863 INFO L273 TraceCheckUtils]: 41: Hoare triple {23735#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23736#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {23736#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23736#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {23736#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23736#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,865 INFO L273 TraceCheckUtils]: 44: Hoare triple {23736#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23737#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,866 INFO L273 TraceCheckUtils]: 45: Hoare triple {23737#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23737#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {23737#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23737#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,867 INFO L273 TraceCheckUtils]: 47: Hoare triple {23737#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23738#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,867 INFO L273 TraceCheckUtils]: 48: Hoare triple {23738#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23738#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,868 INFO L273 TraceCheckUtils]: 49: Hoare triple {23738#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23738#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,869 INFO L273 TraceCheckUtils]: 50: Hoare triple {23738#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23739#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,869 INFO L273 TraceCheckUtils]: 51: Hoare triple {23739#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23739#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,870 INFO L273 TraceCheckUtils]: 52: Hoare triple {23739#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23739#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {23739#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23740#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,871 INFO L273 TraceCheckUtils]: 54: Hoare triple {23740#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23740#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {23740#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23740#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,872 INFO L273 TraceCheckUtils]: 56: Hoare triple {23740#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23741#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,873 INFO L273 TraceCheckUtils]: 57: Hoare triple {23741#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23741#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,873 INFO L273 TraceCheckUtils]: 58: Hoare triple {23741#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23741#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,874 INFO L273 TraceCheckUtils]: 59: Hoare triple {23741#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23742#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,875 INFO L273 TraceCheckUtils]: 60: Hoare triple {23742#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23742#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,875 INFO L273 TraceCheckUtils]: 61: Hoare triple {23742#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23742#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,876 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23743#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,876 INFO L273 TraceCheckUtils]: 63: Hoare triple {23743#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23743#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23743#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23744#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,878 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23744#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,879 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23744#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {23744#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23745#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {23745#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23745#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,881 INFO L273 TraceCheckUtils]: 70: Hoare triple {23745#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23745#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,881 INFO L273 TraceCheckUtils]: 71: Hoare triple {23745#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23746#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,882 INFO L273 TraceCheckUtils]: 72: Hoare triple {23746#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23746#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,882 INFO L273 TraceCheckUtils]: 73: Hoare triple {23746#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23746#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,883 INFO L273 TraceCheckUtils]: 74: Hoare triple {23746#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23747#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,884 INFO L273 TraceCheckUtils]: 75: Hoare triple {23747#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23747#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,884 INFO L273 TraceCheckUtils]: 76: Hoare triple {23747#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23747#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,885 INFO L273 TraceCheckUtils]: 77: Hoare triple {23747#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23748#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,885 INFO L273 TraceCheckUtils]: 78: Hoare triple {23748#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23748#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,886 INFO L273 TraceCheckUtils]: 79: Hoare triple {23748#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23748#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,887 INFO L273 TraceCheckUtils]: 80: Hoare triple {23748#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23749#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,887 INFO L273 TraceCheckUtils]: 81: Hoare triple {23749#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23749#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,888 INFO L273 TraceCheckUtils]: 82: Hoare triple {23749#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23749#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,889 INFO L273 TraceCheckUtils]: 83: Hoare triple {23749#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23750#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,889 INFO L273 TraceCheckUtils]: 84: Hoare triple {23750#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23750#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,890 INFO L273 TraceCheckUtils]: 85: Hoare triple {23750#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23750#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,891 INFO L273 TraceCheckUtils]: 86: Hoare triple {23750#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23751#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,891 INFO L273 TraceCheckUtils]: 87: Hoare triple {23751#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23751#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,892 INFO L273 TraceCheckUtils]: 88: Hoare triple {23751#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23751#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,892 INFO L273 TraceCheckUtils]: 89: Hoare triple {23751#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23752#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,893 INFO L273 TraceCheckUtils]: 90: Hoare triple {23752#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23752#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,893 INFO L273 TraceCheckUtils]: 91: Hoare triple {23752#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23752#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,894 INFO L273 TraceCheckUtils]: 92: Hoare triple {23752#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23753#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,895 INFO L273 TraceCheckUtils]: 93: Hoare triple {23753#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23753#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,895 INFO L273 TraceCheckUtils]: 94: Hoare triple {23753#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23753#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,896 INFO L273 TraceCheckUtils]: 95: Hoare triple {23753#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23754#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,897 INFO L273 TraceCheckUtils]: 96: Hoare triple {23754#(<= main_~i~0 30)} assume !(~i~0 < 100000); {23723#false} is VALID [2018-11-23 11:59:47,897 INFO L273 TraceCheckUtils]: 97: Hoare triple {23723#false} havoc ~x~0; {23723#false} is VALID [2018-11-23 11:59:47,897 INFO L273 TraceCheckUtils]: 98: Hoare triple {23723#false} assume 0 != ~rv~0;~x~0 := 0; {23723#false} is VALID [2018-11-23 11:59:47,897 INFO L273 TraceCheckUtils]: 99: Hoare triple {23723#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {23723#false} is VALID [2018-11-23 11:59:47,897 INFO L256 TraceCheckUtils]: 100: Hoare triple {23723#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {23723#false} is VALID [2018-11-23 11:59:47,898 INFO L273 TraceCheckUtils]: 101: Hoare triple {23723#false} ~cond := #in~cond; {23723#false} is VALID [2018-11-23 11:59:47,898 INFO L273 TraceCheckUtils]: 102: Hoare triple {23723#false} assume 0 == ~cond; {23723#false} is VALID [2018-11-23 11:59:47,898 INFO L273 TraceCheckUtils]: 103: Hoare triple {23723#false} assume !false; {23723#false} is VALID [2018-11-23 11:59:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:47,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:47,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:47,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:56,112 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 11:59:56,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:56,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:56,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {23722#true} call ULTIMATE.init(); {23722#true} is VALID [2018-11-23 11:59:56,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {23722#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23722#true} is VALID [2018-11-23 11:59:56,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {23722#true} assume true; {23722#true} is VALID [2018-11-23 11:59:56,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23722#true} {23722#true} #77#return; {23722#true} is VALID [2018-11-23 11:59:56,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {23722#true} call #t~ret9 := main(); {23722#true} is VALID [2018-11-23 11:59:56,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {23722#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {23773#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:56,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {23773#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23773#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:56,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {23773#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23773#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:56,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {23773#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23725#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:56,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {23725#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23725#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:56,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {23725#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23725#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:56,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {23725#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23726#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:56,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {23726#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23726#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:56,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {23726#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23726#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:56,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {23726#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23727#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:56,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {23727#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23727#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:56,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {23727#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23727#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:56,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {23727#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23728#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:56,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {23728#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23728#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:56,513 INFO L273 TraceCheckUtils]: 19: Hoare triple {23728#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23728#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:56,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {23728#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23729#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:56,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {23729#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23729#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:56,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {23729#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23729#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:56,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {23729#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23730#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:56,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {23730#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23730#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:56,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {23730#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23730#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:56,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {23730#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23731#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:56,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {23731#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23731#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:56,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {23731#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23731#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:56,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {23731#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23732#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:56,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {23732#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23732#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:56,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {23732#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23732#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:56,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {23732#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23733#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:56,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {23733#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23733#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:56,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {23733#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23733#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:56,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {23733#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23734#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:56,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {23734#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23734#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:56,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {23734#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23734#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:56,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {23734#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23735#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:56,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {23735#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23735#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:56,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {23735#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23735#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:56,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {23735#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23736#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:56,527 INFO L273 TraceCheckUtils]: 42: Hoare triple {23736#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23736#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:56,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {23736#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23736#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:56,528 INFO L273 TraceCheckUtils]: 44: Hoare triple {23736#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23737#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:56,529 INFO L273 TraceCheckUtils]: 45: Hoare triple {23737#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23737#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:56,529 INFO L273 TraceCheckUtils]: 46: Hoare triple {23737#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23737#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:56,530 INFO L273 TraceCheckUtils]: 47: Hoare triple {23737#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23738#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:56,531 INFO L273 TraceCheckUtils]: 48: Hoare triple {23738#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23738#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:56,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {23738#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23738#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:56,532 INFO L273 TraceCheckUtils]: 50: Hoare triple {23738#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23739#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:56,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {23739#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23739#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:56,533 INFO L273 TraceCheckUtils]: 52: Hoare triple {23739#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23739#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:56,534 INFO L273 TraceCheckUtils]: 53: Hoare triple {23739#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23740#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:56,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {23740#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23740#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:56,535 INFO L273 TraceCheckUtils]: 55: Hoare triple {23740#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23740#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:56,536 INFO L273 TraceCheckUtils]: 56: Hoare triple {23740#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23741#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:56,536 INFO L273 TraceCheckUtils]: 57: Hoare triple {23741#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23741#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:56,536 INFO L273 TraceCheckUtils]: 58: Hoare triple {23741#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23741#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:56,537 INFO L273 TraceCheckUtils]: 59: Hoare triple {23741#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23742#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:56,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {23742#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23742#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:56,538 INFO L273 TraceCheckUtils]: 61: Hoare triple {23742#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23742#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:56,539 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23743#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:56,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {23743#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23743#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:56,540 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23743#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:56,541 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23744#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:56,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23744#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:56,542 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23744#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:56,543 INFO L273 TraceCheckUtils]: 68: Hoare triple {23744#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23745#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:56,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {23745#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23745#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:56,544 INFO L273 TraceCheckUtils]: 70: Hoare triple {23745#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23745#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:56,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {23745#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23746#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:56,545 INFO L273 TraceCheckUtils]: 72: Hoare triple {23746#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23746#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:56,546 INFO L273 TraceCheckUtils]: 73: Hoare triple {23746#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23746#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:56,547 INFO L273 TraceCheckUtils]: 74: Hoare triple {23746#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23747#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:56,547 INFO L273 TraceCheckUtils]: 75: Hoare triple {23747#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23747#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:56,548 INFO L273 TraceCheckUtils]: 76: Hoare triple {23747#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23747#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:56,548 INFO L273 TraceCheckUtils]: 77: Hoare triple {23747#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23748#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:56,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {23748#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23748#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:56,549 INFO L273 TraceCheckUtils]: 79: Hoare triple {23748#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23748#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:56,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {23748#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23749#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:56,551 INFO L273 TraceCheckUtils]: 81: Hoare triple {23749#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23749#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:56,551 INFO L273 TraceCheckUtils]: 82: Hoare triple {23749#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23749#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:56,552 INFO L273 TraceCheckUtils]: 83: Hoare triple {23749#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23750#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:56,553 INFO L273 TraceCheckUtils]: 84: Hoare triple {23750#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23750#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:56,553 INFO L273 TraceCheckUtils]: 85: Hoare triple {23750#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23750#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:56,554 INFO L273 TraceCheckUtils]: 86: Hoare triple {23750#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23751#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:56,554 INFO L273 TraceCheckUtils]: 87: Hoare triple {23751#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23751#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:56,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {23751#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23751#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:56,556 INFO L273 TraceCheckUtils]: 89: Hoare triple {23751#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23752#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:56,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {23752#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23752#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:56,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {23752#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23752#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:56,558 INFO L273 TraceCheckUtils]: 92: Hoare triple {23752#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23753#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:56,558 INFO L273 TraceCheckUtils]: 93: Hoare triple {23753#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {23753#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:56,559 INFO L273 TraceCheckUtils]: 94: Hoare triple {23753#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {23753#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:56,559 INFO L273 TraceCheckUtils]: 95: Hoare triple {23753#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {23754#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:56,560 INFO L273 TraceCheckUtils]: 96: Hoare triple {23754#(<= main_~i~0 30)} assume !(~i~0 < 100000); {23723#false} is VALID [2018-11-23 11:59:56,560 INFO L273 TraceCheckUtils]: 97: Hoare triple {23723#false} havoc ~x~0; {23723#false} is VALID [2018-11-23 11:59:56,560 INFO L273 TraceCheckUtils]: 98: Hoare triple {23723#false} assume 0 != ~rv~0;~x~0 := 0; {23723#false} is VALID [2018-11-23 11:59:56,561 INFO L273 TraceCheckUtils]: 99: Hoare triple {23723#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {23723#false} is VALID [2018-11-23 11:59:56,561 INFO L256 TraceCheckUtils]: 100: Hoare triple {23723#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {23723#false} is VALID [2018-11-23 11:59:56,561 INFO L273 TraceCheckUtils]: 101: Hoare triple {23723#false} ~cond := #in~cond; {23723#false} is VALID [2018-11-23 11:59:56,561 INFO L273 TraceCheckUtils]: 102: Hoare triple {23723#false} assume 0 == ~cond; {23723#false} is VALID [2018-11-23 11:59:56,561 INFO L273 TraceCheckUtils]: 103: Hoare triple {23723#false} assume !false; {23723#false} is VALID [2018-11-23 11:59:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:56,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:56,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 11:59:56,592 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-11-23 11:59:56,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:56,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:59:56,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:56,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:59:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:59:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:56,695 INFO L87 Difference]: Start difference. First operand 205 states and 269 transitions. Second operand 34 states. [2018-11-23 11:59:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:57,227 INFO L93 Difference]: Finished difference Result 234 states and 307 transitions. [2018-11-23 11:59:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:59:57,227 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-11-23 11:59:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 176 transitions. [2018-11-23 11:59:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 176 transitions. [2018-11-23 11:59:57,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 176 transitions. [2018-11-23 11:59:57,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:57,424 INFO L225 Difference]: With dead ends: 234 [2018-11-23 11:59:57,424 INFO L226 Difference]: Without dead ends: 215 [2018-11-23 11:59:57,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-23 11:59:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-11-23 11:59:57,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:57,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand 211 states. [2018-11-23 11:59:57,526 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 211 states. [2018-11-23 11:59:57,526 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 211 states. [2018-11-23 11:59:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:57,531 INFO L93 Difference]: Finished difference Result 215 states and 283 transitions. [2018-11-23 11:59:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 283 transitions. [2018-11-23 11:59:57,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:57,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:57,531 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 215 states. [2018-11-23 11:59:57,532 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 215 states. [2018-11-23 11:59:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:57,535 INFO L93 Difference]: Finished difference Result 215 states and 283 transitions. [2018-11-23 11:59:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 283 transitions. [2018-11-23 11:59:57,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:57,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:57,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:57,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-23 11:59:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2018-11-23 11:59:57,539 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 104 [2018-11-23 11:59:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:57,539 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2018-11-23 11:59:57,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:59:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2018-11-23 11:59:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:59:57,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:57,540 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:57,540 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:57,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 791284768, now seen corresponding path program 31 times [2018-11-23 11:59:57,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:57,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:58,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {25091#true} call ULTIMATE.init(); {25091#true} is VALID [2018-11-23 11:59:58,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {25091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25091#true} is VALID [2018-11-23 11:59:58,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {25091#true} assume true; {25091#true} is VALID [2018-11-23 11:59:58,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25091#true} {25091#true} #77#return; {25091#true} is VALID [2018-11-23 11:59:58,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {25091#true} call #t~ret9 := main(); {25091#true} is VALID [2018-11-23 11:59:58,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {25091#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {25093#(= main_~i~0 0)} is VALID [2018-11-23 11:59:58,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {25093#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25093#(= main_~i~0 0)} is VALID [2018-11-23 11:59:58,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {25093#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25093#(= main_~i~0 0)} is VALID [2018-11-23 11:59:58,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {25093#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25094#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {25094#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25094#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {25094#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25094#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {25094#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25095#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {25095#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25095#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {25095#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25095#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {25095#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25096#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {25096#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25096#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {25096#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25096#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {25096#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25097#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {25097#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25097#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {25097#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25097#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {25097#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25098#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {25098#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25098#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {25098#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25098#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {25098#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25099#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {25099#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25099#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {25099#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25099#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {25099#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25100#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {25100#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25100#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {25100#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25100#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {25100#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25101#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {25101#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25101#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {25101#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25101#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {25101#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25102#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {25102#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25102#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,195 INFO L273 TraceCheckUtils]: 34: Hoare triple {25102#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25102#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {25102#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25103#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {25103#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25103#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,197 INFO L273 TraceCheckUtils]: 37: Hoare triple {25103#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25103#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {25103#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25104#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,199 INFO L273 TraceCheckUtils]: 39: Hoare triple {25104#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25104#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,199 INFO L273 TraceCheckUtils]: 40: Hoare triple {25104#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25104#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {25104#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25105#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {25105#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25105#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {25105#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25105#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {25105#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25106#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,202 INFO L273 TraceCheckUtils]: 45: Hoare triple {25106#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25106#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {25106#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25106#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,204 INFO L273 TraceCheckUtils]: 47: Hoare triple {25106#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25107#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {25107#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25107#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {25107#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25107#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,207 INFO L273 TraceCheckUtils]: 50: Hoare triple {25107#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25108#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {25108#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25108#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {25108#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25108#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,209 INFO L273 TraceCheckUtils]: 53: Hoare triple {25108#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25109#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,209 INFO L273 TraceCheckUtils]: 54: Hoare triple {25109#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25109#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,210 INFO L273 TraceCheckUtils]: 55: Hoare triple {25109#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25109#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {25109#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25110#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {25110#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25110#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {25110#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25110#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {25110#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25111#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,213 INFO L273 TraceCheckUtils]: 60: Hoare triple {25111#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25111#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {25111#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25111#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {25111#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25112#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {25112#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25112#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {25112#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25112#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {25112#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25113#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,217 INFO L273 TraceCheckUtils]: 66: Hoare triple {25113#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25113#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,217 INFO L273 TraceCheckUtils]: 67: Hoare triple {25113#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25113#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,218 INFO L273 TraceCheckUtils]: 68: Hoare triple {25113#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25114#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,218 INFO L273 TraceCheckUtils]: 69: Hoare triple {25114#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25114#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,219 INFO L273 TraceCheckUtils]: 70: Hoare triple {25114#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25114#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,220 INFO L273 TraceCheckUtils]: 71: Hoare triple {25114#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25115#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,220 INFO L273 TraceCheckUtils]: 72: Hoare triple {25115#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25115#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,221 INFO L273 TraceCheckUtils]: 73: Hoare triple {25115#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25115#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,222 INFO L273 TraceCheckUtils]: 74: Hoare triple {25115#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25116#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,222 INFO L273 TraceCheckUtils]: 75: Hoare triple {25116#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25116#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,223 INFO L273 TraceCheckUtils]: 76: Hoare triple {25116#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25116#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,224 INFO L273 TraceCheckUtils]: 77: Hoare triple {25116#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25117#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,224 INFO L273 TraceCheckUtils]: 78: Hoare triple {25117#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25117#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,225 INFO L273 TraceCheckUtils]: 79: Hoare triple {25117#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25117#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,226 INFO L273 TraceCheckUtils]: 80: Hoare triple {25117#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25118#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,226 INFO L273 TraceCheckUtils]: 81: Hoare triple {25118#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25118#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,227 INFO L273 TraceCheckUtils]: 82: Hoare triple {25118#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25118#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,228 INFO L273 TraceCheckUtils]: 83: Hoare triple {25118#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25119#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,228 INFO L273 TraceCheckUtils]: 84: Hoare triple {25119#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25119#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,228 INFO L273 TraceCheckUtils]: 85: Hoare triple {25119#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25119#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,229 INFO L273 TraceCheckUtils]: 86: Hoare triple {25119#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25120#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,230 INFO L273 TraceCheckUtils]: 87: Hoare triple {25120#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25120#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,230 INFO L273 TraceCheckUtils]: 88: Hoare triple {25120#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25120#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,231 INFO L273 TraceCheckUtils]: 89: Hoare triple {25120#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25121#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,232 INFO L273 TraceCheckUtils]: 90: Hoare triple {25121#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25121#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,232 INFO L273 TraceCheckUtils]: 91: Hoare triple {25121#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25121#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,233 INFO L273 TraceCheckUtils]: 92: Hoare triple {25121#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25122#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,234 INFO L273 TraceCheckUtils]: 93: Hoare triple {25122#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25122#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,234 INFO L273 TraceCheckUtils]: 94: Hoare triple {25122#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25122#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,235 INFO L273 TraceCheckUtils]: 95: Hoare triple {25122#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25123#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,236 INFO L273 TraceCheckUtils]: 96: Hoare triple {25123#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25123#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,236 INFO L273 TraceCheckUtils]: 97: Hoare triple {25123#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25123#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,237 INFO L273 TraceCheckUtils]: 98: Hoare triple {25123#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25124#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,238 INFO L273 TraceCheckUtils]: 99: Hoare triple {25124#(<= main_~i~0 31)} assume !(~i~0 < 100000); {25092#false} is VALID [2018-11-23 11:59:58,238 INFO L273 TraceCheckUtils]: 100: Hoare triple {25092#false} havoc ~x~0; {25092#false} is VALID [2018-11-23 11:59:58,238 INFO L273 TraceCheckUtils]: 101: Hoare triple {25092#false} assume 0 != ~rv~0;~x~0 := 0; {25092#false} is VALID [2018-11-23 11:59:58,238 INFO L273 TraceCheckUtils]: 102: Hoare triple {25092#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {25092#false} is VALID [2018-11-23 11:59:58,238 INFO L256 TraceCheckUtils]: 103: Hoare triple {25092#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {25092#false} is VALID [2018-11-23 11:59:58,239 INFO L273 TraceCheckUtils]: 104: Hoare triple {25092#false} ~cond := #in~cond; {25092#false} is VALID [2018-11-23 11:59:58,239 INFO L273 TraceCheckUtils]: 105: Hoare triple {25092#false} assume 0 == ~cond; {25092#false} is VALID [2018-11-23 11:59:58,239 INFO L273 TraceCheckUtils]: 106: Hoare triple {25092#false} assume !false; {25092#false} is VALID [2018-11-23 11:59:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:58,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:58,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:58,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:58,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {25091#true} call ULTIMATE.init(); {25091#true} is VALID [2018-11-23 11:59:58,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {25091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25091#true} is VALID [2018-11-23 11:59:58,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {25091#true} assume true; {25091#true} is VALID [2018-11-23 11:59:58,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25091#true} {25091#true} #77#return; {25091#true} is VALID [2018-11-23 11:59:58,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {25091#true} call #t~ret9 := main(); {25091#true} is VALID [2018-11-23 11:59:58,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {25091#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {25143#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:58,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {25143#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25143#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:58,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {25143#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25143#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:58,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {25143#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25094#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {25094#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25094#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {25094#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25094#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:58,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {25094#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25095#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {25095#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25095#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {25095#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25095#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {25095#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25096#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {25096#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25096#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {25096#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25096#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {25096#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25097#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {25097#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25097#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {25097#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25097#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {25097#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25098#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {25098#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25098#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {25098#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25098#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {25098#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25099#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {25099#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25099#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {25099#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25099#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {25099#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25100#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {25100#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25100#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {25100#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25100#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {25100#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25101#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {25101#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25101#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {25101#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25101#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {25101#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25102#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {25102#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25102#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {25102#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25102#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,610 INFO L273 TraceCheckUtils]: 35: Hoare triple {25102#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25103#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,610 INFO L273 TraceCheckUtils]: 36: Hoare triple {25103#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25103#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {25103#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25103#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {25103#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25104#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {25104#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25104#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {25104#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25104#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {25104#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25105#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {25105#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25105#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,659 INFO L273 TraceCheckUtils]: 43: Hoare triple {25105#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25105#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {25105#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25106#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {25106#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25106#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {25106#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25106#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,660 INFO L273 TraceCheckUtils]: 47: Hoare triple {25106#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25107#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {25107#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25107#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {25107#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25107#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {25107#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25108#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,662 INFO L273 TraceCheckUtils]: 51: Hoare triple {25108#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25108#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,662 INFO L273 TraceCheckUtils]: 52: Hoare triple {25108#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25108#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,663 INFO L273 TraceCheckUtils]: 53: Hoare triple {25108#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25109#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,664 INFO L273 TraceCheckUtils]: 54: Hoare triple {25109#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25109#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,664 INFO L273 TraceCheckUtils]: 55: Hoare triple {25109#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25109#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,665 INFO L273 TraceCheckUtils]: 56: Hoare triple {25109#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25110#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,666 INFO L273 TraceCheckUtils]: 57: Hoare triple {25110#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25110#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,666 INFO L273 TraceCheckUtils]: 58: Hoare triple {25110#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25110#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,667 INFO L273 TraceCheckUtils]: 59: Hoare triple {25110#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25111#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,668 INFO L273 TraceCheckUtils]: 60: Hoare triple {25111#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25111#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,668 INFO L273 TraceCheckUtils]: 61: Hoare triple {25111#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25111#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,669 INFO L273 TraceCheckUtils]: 62: Hoare triple {25111#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25112#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,670 INFO L273 TraceCheckUtils]: 63: Hoare triple {25112#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25112#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,670 INFO L273 TraceCheckUtils]: 64: Hoare triple {25112#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25112#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,671 INFO L273 TraceCheckUtils]: 65: Hoare triple {25112#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25113#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,671 INFO L273 TraceCheckUtils]: 66: Hoare triple {25113#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25113#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,672 INFO L273 TraceCheckUtils]: 67: Hoare triple {25113#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25113#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {25113#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25114#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {25114#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25114#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,674 INFO L273 TraceCheckUtils]: 70: Hoare triple {25114#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25114#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,675 INFO L273 TraceCheckUtils]: 71: Hoare triple {25114#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25115#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,675 INFO L273 TraceCheckUtils]: 72: Hoare triple {25115#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25115#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {25115#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25115#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {25115#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25116#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {25116#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25116#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {25116#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25116#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,678 INFO L273 TraceCheckUtils]: 77: Hoare triple {25116#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25117#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,679 INFO L273 TraceCheckUtils]: 78: Hoare triple {25117#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25117#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,679 INFO L273 TraceCheckUtils]: 79: Hoare triple {25117#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25117#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,680 INFO L273 TraceCheckUtils]: 80: Hoare triple {25117#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25118#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,681 INFO L273 TraceCheckUtils]: 81: Hoare triple {25118#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25118#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,681 INFO L273 TraceCheckUtils]: 82: Hoare triple {25118#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25118#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,682 INFO L273 TraceCheckUtils]: 83: Hoare triple {25118#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25119#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,683 INFO L273 TraceCheckUtils]: 84: Hoare triple {25119#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25119#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,683 INFO L273 TraceCheckUtils]: 85: Hoare triple {25119#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25119#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,684 INFO L273 TraceCheckUtils]: 86: Hoare triple {25119#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25120#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,685 INFO L273 TraceCheckUtils]: 87: Hoare triple {25120#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25120#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,685 INFO L273 TraceCheckUtils]: 88: Hoare triple {25120#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25120#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,686 INFO L273 TraceCheckUtils]: 89: Hoare triple {25120#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25121#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {25121#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25121#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,687 INFO L273 TraceCheckUtils]: 91: Hoare triple {25121#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25121#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,688 INFO L273 TraceCheckUtils]: 92: Hoare triple {25121#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25122#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,688 INFO L273 TraceCheckUtils]: 93: Hoare triple {25122#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25122#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,689 INFO L273 TraceCheckUtils]: 94: Hoare triple {25122#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25122#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,690 INFO L273 TraceCheckUtils]: 95: Hoare triple {25122#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25123#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,690 INFO L273 TraceCheckUtils]: 96: Hoare triple {25123#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {25123#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,691 INFO L273 TraceCheckUtils]: 97: Hoare triple {25123#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {25123#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,692 INFO L273 TraceCheckUtils]: 98: Hoare triple {25123#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {25124#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,692 INFO L273 TraceCheckUtils]: 99: Hoare triple {25124#(<= main_~i~0 31)} assume !(~i~0 < 100000); {25092#false} is VALID [2018-11-23 11:59:58,693 INFO L273 TraceCheckUtils]: 100: Hoare triple {25092#false} havoc ~x~0; {25092#false} is VALID [2018-11-23 11:59:58,693 INFO L273 TraceCheckUtils]: 101: Hoare triple {25092#false} assume 0 != ~rv~0;~x~0 := 0; {25092#false} is VALID [2018-11-23 11:59:58,693 INFO L273 TraceCheckUtils]: 102: Hoare triple {25092#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {25092#false} is VALID [2018-11-23 11:59:58,693 INFO L256 TraceCheckUtils]: 103: Hoare triple {25092#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {25092#false} is VALID [2018-11-23 11:59:58,693 INFO L273 TraceCheckUtils]: 104: Hoare triple {25092#false} ~cond := #in~cond; {25092#false} is VALID [2018-11-23 11:59:58,693 INFO L273 TraceCheckUtils]: 105: Hoare triple {25092#false} assume 0 == ~cond; {25092#false} is VALID [2018-11-23 11:59:58,694 INFO L273 TraceCheckUtils]: 106: Hoare triple {25092#false} assume !false; {25092#false} is VALID [2018-11-23 11:59:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:58,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:58,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 11:59:58,720 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2018-11-23 11:59:58,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:58,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:59:58,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:58,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:59:58,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:59:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:59:58,880 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 35 states. [2018-11-23 11:59:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,875 INFO L93 Difference]: Finished difference Result 240 states and 315 transitions. [2018-11-23 11:59:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:59:59,876 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2018-11-23 11:59:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 180 transitions. [2018-11-23 11:59:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 180 transitions. [2018-11-23 11:59:59,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 180 transitions. [2018-11-23 12:00:00,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:00,042 INFO L225 Difference]: With dead ends: 240 [2018-11-23 12:00:00,042 INFO L226 Difference]: Without dead ends: 221 [2018-11-23 12:00:00,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:00:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-23 12:00:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-11-23 12:00:00,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:00,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand 217 states. [2018-11-23 12:00:00,123 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 217 states. [2018-11-23 12:00:00,124 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 217 states. [2018-11-23 12:00:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:00,128 INFO L93 Difference]: Finished difference Result 221 states and 291 transitions. [2018-11-23 12:00:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 291 transitions. [2018-11-23 12:00:00,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:00,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:00,128 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 221 states. [2018-11-23 12:00:00,129 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 221 states. [2018-11-23 12:00:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:00,133 INFO L93 Difference]: Finished difference Result 221 states and 291 transitions. [2018-11-23 12:00:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 291 transitions. [2018-11-23 12:00:00,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:00,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:00,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:00,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 12:00:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 285 transitions. [2018-11-23 12:00:00,138 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 285 transitions. Word has length 107 [2018-11-23 12:00:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:00,139 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 285 transitions. [2018-11-23 12:00:00,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:00:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 285 transitions. [2018-11-23 12:00:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:00:00,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:00,140 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:00,140 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:00,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1797845280, now seen corresponding path program 32 times [2018-11-23 12:00:00,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:00,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:00,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {26498#true} call ULTIMATE.init(); {26498#true} is VALID [2018-11-23 12:00:00,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {26498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26498#true} is VALID [2018-11-23 12:00:00,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:00:00,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26498#true} {26498#true} #77#return; {26498#true} is VALID [2018-11-23 12:00:00,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {26498#true} call #t~ret9 := main(); {26498#true} is VALID [2018-11-23 12:00:00,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {26498#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {26500#(= main_~i~0 0)} is VALID [2018-11-23 12:00:00,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {26500#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26500#(= main_~i~0 0)} is VALID [2018-11-23 12:00:00,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {26500#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26500#(= main_~i~0 0)} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {26500#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26501#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {26501#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26501#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:00,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {26501#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26501#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {26501#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26502#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {26502#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26502#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:00,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {26502#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26502#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {26502#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26503#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:00,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {26503#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26503#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:00,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {26503#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26503#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {26503#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26504#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:00,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {26504#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26504#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:00,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {26504#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26504#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:00,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {26504#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26505#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {26505#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26505#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:00,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {26505#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26505#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:00,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {26505#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26506#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {26506#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26506#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:00,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {26506#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26506#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:00,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {26506#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26507#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:00,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {26507#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26507#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:00,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {26507#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26507#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:00,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {26507#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26508#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:00,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {26508#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26508#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:00,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {26508#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26508#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:00,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {26508#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26509#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:00,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {26509#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26509#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:00,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {26509#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26509#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:00,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {26509#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:00,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {26510#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:00,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {26510#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:00,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {26510#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26511#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:00,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {26511#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26511#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:00,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {26511#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26511#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:00,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {26511#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26512#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:00,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {26512#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26512#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:00,889 INFO L273 TraceCheckUtils]: 43: Hoare triple {26512#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26512#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:00,890 INFO L273 TraceCheckUtils]: 44: Hoare triple {26512#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26513#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:00,890 INFO L273 TraceCheckUtils]: 45: Hoare triple {26513#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26513#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:00,891 INFO L273 TraceCheckUtils]: 46: Hoare triple {26513#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26513#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:00,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {26513#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26514#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:00,892 INFO L273 TraceCheckUtils]: 48: Hoare triple {26514#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26514#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:00,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {26514#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26514#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:00,893 INFO L273 TraceCheckUtils]: 50: Hoare triple {26514#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26515#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:00,894 INFO L273 TraceCheckUtils]: 51: Hoare triple {26515#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26515#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:00,894 INFO L273 TraceCheckUtils]: 52: Hoare triple {26515#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26515#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:00,895 INFO L273 TraceCheckUtils]: 53: Hoare triple {26515#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26516#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:00,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {26516#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26516#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:00,896 INFO L273 TraceCheckUtils]: 55: Hoare triple {26516#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26516#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:00,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {26516#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26517#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:00,898 INFO L273 TraceCheckUtils]: 57: Hoare triple {26517#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26517#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:00,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {26517#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26517#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:00,899 INFO L273 TraceCheckUtils]: 59: Hoare triple {26517#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26518#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:00,899 INFO L273 TraceCheckUtils]: 60: Hoare triple {26518#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26518#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:00,900 INFO L273 TraceCheckUtils]: 61: Hoare triple {26518#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26518#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:00,901 INFO L273 TraceCheckUtils]: 62: Hoare triple {26518#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26519#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:00,901 INFO L273 TraceCheckUtils]: 63: Hoare triple {26519#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26519#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:00,902 INFO L273 TraceCheckUtils]: 64: Hoare triple {26519#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26519#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:00,903 INFO L273 TraceCheckUtils]: 65: Hoare triple {26519#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26520#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:00,903 INFO L273 TraceCheckUtils]: 66: Hoare triple {26520#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26520#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:00,903 INFO L273 TraceCheckUtils]: 67: Hoare triple {26520#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26520#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:00,904 INFO L273 TraceCheckUtils]: 68: Hoare triple {26520#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26521#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:00,905 INFO L273 TraceCheckUtils]: 69: Hoare triple {26521#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26521#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:00,905 INFO L273 TraceCheckUtils]: 70: Hoare triple {26521#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26521#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:00,906 INFO L273 TraceCheckUtils]: 71: Hoare triple {26521#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:00,907 INFO L273 TraceCheckUtils]: 72: Hoare triple {26522#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:00,907 INFO L273 TraceCheckUtils]: 73: Hoare triple {26522#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26522#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:00,908 INFO L273 TraceCheckUtils]: 74: Hoare triple {26522#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:00,908 INFO L273 TraceCheckUtils]: 75: Hoare triple {26523#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:00,909 INFO L273 TraceCheckUtils]: 76: Hoare triple {26523#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26523#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:00,910 INFO L273 TraceCheckUtils]: 77: Hoare triple {26523#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:00,910 INFO L273 TraceCheckUtils]: 78: Hoare triple {26524#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:00,911 INFO L273 TraceCheckUtils]: 79: Hoare triple {26524#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26524#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:00,912 INFO L273 TraceCheckUtils]: 80: Hoare triple {26524#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:00,912 INFO L273 TraceCheckUtils]: 81: Hoare triple {26525#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:00,913 INFO L273 TraceCheckUtils]: 82: Hoare triple {26525#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26525#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:00,913 INFO L273 TraceCheckUtils]: 83: Hoare triple {26525#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:00,914 INFO L273 TraceCheckUtils]: 84: Hoare triple {26526#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:00,914 INFO L273 TraceCheckUtils]: 85: Hoare triple {26526#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26526#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:00,915 INFO L273 TraceCheckUtils]: 86: Hoare triple {26526#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:00,916 INFO L273 TraceCheckUtils]: 87: Hoare triple {26527#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:00,916 INFO L273 TraceCheckUtils]: 88: Hoare triple {26527#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26527#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:00,917 INFO L273 TraceCheckUtils]: 89: Hoare triple {26527#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:00,917 INFO L273 TraceCheckUtils]: 90: Hoare triple {26528#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:00,918 INFO L273 TraceCheckUtils]: 91: Hoare triple {26528#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26528#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:00,919 INFO L273 TraceCheckUtils]: 92: Hoare triple {26528#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:00,923 INFO L273 TraceCheckUtils]: 93: Hoare triple {26529#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:00,924 INFO L273 TraceCheckUtils]: 94: Hoare triple {26529#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26529#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:00,924 INFO L273 TraceCheckUtils]: 95: Hoare triple {26529#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:00,924 INFO L273 TraceCheckUtils]: 96: Hoare triple {26530#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:00,925 INFO L273 TraceCheckUtils]: 97: Hoare triple {26530#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26530#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:00,925 INFO L273 TraceCheckUtils]: 98: Hoare triple {26530#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:00,926 INFO L273 TraceCheckUtils]: 99: Hoare triple {26531#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:00,926 INFO L273 TraceCheckUtils]: 100: Hoare triple {26531#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26531#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:00,926 INFO L273 TraceCheckUtils]: 101: Hoare triple {26531#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:00,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {26532#(<= main_~i~0 32)} assume !(~i~0 < 100000); {26499#false} is VALID [2018-11-23 12:00:00,927 INFO L273 TraceCheckUtils]: 103: Hoare triple {26499#false} havoc ~x~0; {26499#false} is VALID [2018-11-23 12:00:00,927 INFO L273 TraceCheckUtils]: 104: Hoare triple {26499#false} assume 0 != ~rv~0;~x~0 := 0; {26499#false} is VALID [2018-11-23 12:00:00,927 INFO L273 TraceCheckUtils]: 105: Hoare triple {26499#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {26499#false} is VALID [2018-11-23 12:00:00,928 INFO L256 TraceCheckUtils]: 106: Hoare triple {26499#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {26499#false} is VALID [2018-11-23 12:00:00,928 INFO L273 TraceCheckUtils]: 107: Hoare triple {26499#false} ~cond := #in~cond; {26499#false} is VALID [2018-11-23 12:00:00,928 INFO L273 TraceCheckUtils]: 108: Hoare triple {26499#false} assume 0 == ~cond; {26499#false} is VALID [2018-11-23 12:00:00,928 INFO L273 TraceCheckUtils]: 109: Hoare triple {26499#false} assume !false; {26499#false} is VALID [2018-11-23 12:00:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:00,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:00,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:00,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:01,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:01,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:01,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:01,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {26498#true} call ULTIMATE.init(); {26498#true} is VALID [2018-11-23 12:00:01,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {26498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26498#true} is VALID [2018-11-23 12:00:01,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {26498#true} assume true; {26498#true} is VALID [2018-11-23 12:00:01,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26498#true} {26498#true} #77#return; {26498#true} is VALID [2018-11-23 12:00:01,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {26498#true} call #t~ret9 := main(); {26498#true} is VALID [2018-11-23 12:00:01,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {26498#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {26551#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:01,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {26551#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:01,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {26551#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26551#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:01,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {26551#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26501#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:01,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {26501#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26501#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:01,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {26501#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26501#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:01,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {26501#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26502#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:01,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {26502#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26502#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:01,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {26502#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26502#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:01,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {26502#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26503#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:01,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {26503#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26503#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:01,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {26503#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26503#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:01,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {26503#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26504#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:01,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {26504#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26504#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:01,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {26504#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26504#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:01,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {26504#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26505#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:01,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {26505#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26505#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:01,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {26505#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26505#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:01,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {26505#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26506#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:01,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {26506#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26506#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:01,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {26506#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26506#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:01,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {26506#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26507#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {26507#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26507#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:01,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {26507#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26507#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:01,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {26507#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26508#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:01,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {26508#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26508#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:01,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {26508#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26508#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {26508#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26509#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:01,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {26509#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26509#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:01,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {26509#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26509#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:01,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {26509#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:01,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {26510#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:01,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {26510#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:01,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {26510#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26511#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:01,328 INFO L273 TraceCheckUtils]: 39: Hoare triple {26511#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26511#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:01,328 INFO L273 TraceCheckUtils]: 40: Hoare triple {26511#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26511#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:01,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {26511#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26512#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:01,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {26512#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26512#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:01,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {26512#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26512#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:01,332 INFO L273 TraceCheckUtils]: 44: Hoare triple {26512#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26513#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:01,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {26513#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26513#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:01,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {26513#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26513#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:01,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {26513#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26514#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:01,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {26514#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26514#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:01,335 INFO L273 TraceCheckUtils]: 49: Hoare triple {26514#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26514#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:01,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {26514#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26515#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:01,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {26515#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26515#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:01,337 INFO L273 TraceCheckUtils]: 52: Hoare triple {26515#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26515#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:01,338 INFO L273 TraceCheckUtils]: 53: Hoare triple {26515#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26516#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:01,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {26516#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26516#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:01,340 INFO L273 TraceCheckUtils]: 55: Hoare triple {26516#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26516#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:01,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {26516#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26517#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:01,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {26517#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26517#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:01,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {26517#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26517#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:01,343 INFO L273 TraceCheckUtils]: 59: Hoare triple {26517#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26518#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:01,344 INFO L273 TraceCheckUtils]: 60: Hoare triple {26518#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26518#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:01,344 INFO L273 TraceCheckUtils]: 61: Hoare triple {26518#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26518#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:01,345 INFO L273 TraceCheckUtils]: 62: Hoare triple {26518#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26519#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:01,347 INFO L273 TraceCheckUtils]: 63: Hoare triple {26519#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26519#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:01,347 INFO L273 TraceCheckUtils]: 64: Hoare triple {26519#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26519#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:01,349 INFO L273 TraceCheckUtils]: 65: Hoare triple {26519#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26520#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:01,368 INFO L273 TraceCheckUtils]: 66: Hoare triple {26520#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26520#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:01,377 INFO L273 TraceCheckUtils]: 67: Hoare triple {26520#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26520#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:01,384 INFO L273 TraceCheckUtils]: 68: Hoare triple {26520#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26521#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:01,385 INFO L273 TraceCheckUtils]: 69: Hoare triple {26521#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26521#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:01,389 INFO L273 TraceCheckUtils]: 70: Hoare triple {26521#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26521#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:01,389 INFO L273 TraceCheckUtils]: 71: Hoare triple {26521#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:01,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {26522#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:01,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {26522#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26522#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:01,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {26522#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:01,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {26523#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:01,392 INFO L273 TraceCheckUtils]: 76: Hoare triple {26523#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26523#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:01,392 INFO L273 TraceCheckUtils]: 77: Hoare triple {26523#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:01,393 INFO L273 TraceCheckUtils]: 78: Hoare triple {26524#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:01,394 INFO L273 TraceCheckUtils]: 79: Hoare triple {26524#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26524#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:01,395 INFO L273 TraceCheckUtils]: 80: Hoare triple {26524#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:01,395 INFO L273 TraceCheckUtils]: 81: Hoare triple {26525#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:01,396 INFO L273 TraceCheckUtils]: 82: Hoare triple {26525#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26525#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:01,397 INFO L273 TraceCheckUtils]: 83: Hoare triple {26525#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:01,398 INFO L273 TraceCheckUtils]: 84: Hoare triple {26526#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:01,398 INFO L273 TraceCheckUtils]: 85: Hoare triple {26526#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26526#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:01,399 INFO L273 TraceCheckUtils]: 86: Hoare triple {26526#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:01,400 INFO L273 TraceCheckUtils]: 87: Hoare triple {26527#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:01,401 INFO L273 TraceCheckUtils]: 88: Hoare triple {26527#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26527#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:01,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {26527#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:01,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {26528#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:01,403 INFO L273 TraceCheckUtils]: 91: Hoare triple {26528#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26528#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:01,404 INFO L273 TraceCheckUtils]: 92: Hoare triple {26528#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:01,405 INFO L273 TraceCheckUtils]: 93: Hoare triple {26529#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:01,405 INFO L273 TraceCheckUtils]: 94: Hoare triple {26529#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26529#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:01,406 INFO L273 TraceCheckUtils]: 95: Hoare triple {26529#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:01,407 INFO L273 TraceCheckUtils]: 96: Hoare triple {26530#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:01,407 INFO L273 TraceCheckUtils]: 97: Hoare triple {26530#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26530#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:01,408 INFO L273 TraceCheckUtils]: 98: Hoare triple {26530#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:01,409 INFO L273 TraceCheckUtils]: 99: Hoare triple {26531#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:01,409 INFO L273 TraceCheckUtils]: 100: Hoare triple {26531#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {26531#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:01,410 INFO L273 TraceCheckUtils]: 101: Hoare triple {26531#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:01,411 INFO L273 TraceCheckUtils]: 102: Hoare triple {26532#(<= main_~i~0 32)} assume !(~i~0 < 100000); {26499#false} is VALID [2018-11-23 12:00:01,411 INFO L273 TraceCheckUtils]: 103: Hoare triple {26499#false} havoc ~x~0; {26499#false} is VALID [2018-11-23 12:00:01,411 INFO L273 TraceCheckUtils]: 104: Hoare triple {26499#false} assume 0 != ~rv~0;~x~0 := 0; {26499#false} is VALID [2018-11-23 12:00:01,411 INFO L273 TraceCheckUtils]: 105: Hoare triple {26499#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {26499#false} is VALID [2018-11-23 12:00:01,411 INFO L256 TraceCheckUtils]: 106: Hoare triple {26499#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {26499#false} is VALID [2018-11-23 12:00:01,412 INFO L273 TraceCheckUtils]: 107: Hoare triple {26499#false} ~cond := #in~cond; {26499#false} is VALID [2018-11-23 12:00:01,412 INFO L273 TraceCheckUtils]: 108: Hoare triple {26499#false} assume 0 == ~cond; {26499#false} is VALID [2018-11-23 12:00:01,412 INFO L273 TraceCheckUtils]: 109: Hoare triple {26499#false} assume !false; {26499#false} is VALID [2018-11-23 12:00:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:01,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:01,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:00:01,447 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2018-11-23 12:00:01,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:01,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:00:01,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:01,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:00:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:00:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:00:01,592 INFO L87 Difference]: Start difference. First operand 217 states and 285 transitions. Second operand 36 states. [2018-11-23 12:00:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:02,509 INFO L93 Difference]: Finished difference Result 246 states and 323 transitions. [2018-11-23 12:00:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:00:02,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2018-11-23 12:00:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:00:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 184 transitions. [2018-11-23 12:00:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:00:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 184 transitions. [2018-11-23 12:00:02,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 184 transitions. [2018-11-23 12:00:02,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:02,727 INFO L225 Difference]: With dead ends: 246 [2018-11-23 12:00:02,727 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 12:00:02,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:00:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 12:00:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-11-23 12:00:02,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:02,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand 223 states. [2018-11-23 12:00:02,839 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 223 states. [2018-11-23 12:00:02,840 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 223 states. [2018-11-23 12:00:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:02,843 INFO L93 Difference]: Finished difference Result 227 states and 299 transitions. [2018-11-23 12:00:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 299 transitions. [2018-11-23 12:00:02,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:02,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:02,844 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 227 states. [2018-11-23 12:00:02,844 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 227 states. [2018-11-23 12:00:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:02,848 INFO L93 Difference]: Finished difference Result 227 states and 299 transitions. [2018-11-23 12:00:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 299 transitions. [2018-11-23 12:00:02,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:02,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:02,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:02,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-23 12:00:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 293 transitions. [2018-11-23 12:00:02,853 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 293 transitions. Word has length 110 [2018-11-23 12:00:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:02,853 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 293 transitions. [2018-11-23 12:00:02,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:00:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 293 transitions. [2018-11-23 12:00:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 12:00:02,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:02,854 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:02,855 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:02,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1253436384, now seen corresponding path program 33 times [2018-11-23 12:00:02,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:02,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:03,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {27943#true} call ULTIMATE.init(); {27943#true} is VALID [2018-11-23 12:00:03,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {27943#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27943#true} is VALID [2018-11-23 12:00:03,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {27943#true} assume true; {27943#true} is VALID [2018-11-23 12:00:03,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27943#true} {27943#true} #77#return; {27943#true} is VALID [2018-11-23 12:00:03,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {27943#true} call #t~ret9 := main(); {27943#true} is VALID [2018-11-23 12:00:03,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {27943#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {27945#(= main_~i~0 0)} is VALID [2018-11-23 12:00:03,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {27945#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27945#(= main_~i~0 0)} is VALID [2018-11-23 12:00:03,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {27945#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27945#(= main_~i~0 0)} is VALID [2018-11-23 12:00:03,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {27945#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27946#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {27946#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27946#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {27946#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27946#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:03,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {27946#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27947#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {27947#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27947#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {27947#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27947#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:03,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {27947#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27948#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {27948#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27948#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {27948#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27948#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:03,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {27948#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27949#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {27949#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27949#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {27949#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27949#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:03,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {27949#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27950#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {27950#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27950#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {27950#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27950#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:03,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {27950#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27951#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {27951#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27951#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,860 INFO L273 TraceCheckUtils]: 25: Hoare triple {27951#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27951#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:03,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {27951#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27952#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,861 INFO L273 TraceCheckUtils]: 27: Hoare triple {27952#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27952#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {27952#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27952#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:03,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {27952#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27953#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {27953#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27953#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {27953#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27953#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:03,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {27953#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27954#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {27954#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27954#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {27954#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27954#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:03,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {27954#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27955#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {27955#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27955#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {27955#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27955#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:03,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {27955#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27956#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,868 INFO L273 TraceCheckUtils]: 39: Hoare triple {27956#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27956#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {27956#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27956#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:03,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {27956#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27957#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {27957#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27957#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,871 INFO L273 TraceCheckUtils]: 43: Hoare triple {27957#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27957#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:03,872 INFO L273 TraceCheckUtils]: 44: Hoare triple {27957#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27958#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,872 INFO L273 TraceCheckUtils]: 45: Hoare triple {27958#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27958#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,872 INFO L273 TraceCheckUtils]: 46: Hoare triple {27958#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27958#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:03,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {27958#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27959#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,874 INFO L273 TraceCheckUtils]: 48: Hoare triple {27959#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27959#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,874 INFO L273 TraceCheckUtils]: 49: Hoare triple {27959#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27959#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:03,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {27959#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27960#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,876 INFO L273 TraceCheckUtils]: 51: Hoare triple {27960#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27960#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,876 INFO L273 TraceCheckUtils]: 52: Hoare triple {27960#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27960#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:03,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {27960#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27961#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,877 INFO L273 TraceCheckUtils]: 54: Hoare triple {27961#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27961#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {27961#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27961#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:03,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {27961#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27962#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {27962#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27962#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {27962#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27962#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:03,881 INFO L273 TraceCheckUtils]: 59: Hoare triple {27962#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27963#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {27963#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27963#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {27963#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27963#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:03,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {27963#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27964#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,883 INFO L273 TraceCheckUtils]: 63: Hoare triple {27964#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27964#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,883 INFO L273 TraceCheckUtils]: 64: Hoare triple {27964#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27964#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:03,884 INFO L273 TraceCheckUtils]: 65: Hoare triple {27964#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27965#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,885 INFO L273 TraceCheckUtils]: 66: Hoare triple {27965#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27965#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,885 INFO L273 TraceCheckUtils]: 67: Hoare triple {27965#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27965#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:03,886 INFO L273 TraceCheckUtils]: 68: Hoare triple {27965#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27966#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,886 INFO L273 TraceCheckUtils]: 69: Hoare triple {27966#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27966#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,887 INFO L273 TraceCheckUtils]: 70: Hoare triple {27966#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27966#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:03,888 INFO L273 TraceCheckUtils]: 71: Hoare triple {27966#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27967#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,888 INFO L273 TraceCheckUtils]: 72: Hoare triple {27967#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27967#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,889 INFO L273 TraceCheckUtils]: 73: Hoare triple {27967#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27967#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:03,890 INFO L273 TraceCheckUtils]: 74: Hoare triple {27967#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27968#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,890 INFO L273 TraceCheckUtils]: 75: Hoare triple {27968#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27968#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,890 INFO L273 TraceCheckUtils]: 76: Hoare triple {27968#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27968#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:03,891 INFO L273 TraceCheckUtils]: 77: Hoare triple {27968#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27969#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,892 INFO L273 TraceCheckUtils]: 78: Hoare triple {27969#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27969#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,892 INFO L273 TraceCheckUtils]: 79: Hoare triple {27969#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27969#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:03,893 INFO L273 TraceCheckUtils]: 80: Hoare triple {27969#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27970#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,894 INFO L273 TraceCheckUtils]: 81: Hoare triple {27970#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27970#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,894 INFO L273 TraceCheckUtils]: 82: Hoare triple {27970#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27970#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:03,895 INFO L273 TraceCheckUtils]: 83: Hoare triple {27970#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27971#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,895 INFO L273 TraceCheckUtils]: 84: Hoare triple {27971#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27971#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,896 INFO L273 TraceCheckUtils]: 85: Hoare triple {27971#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27971#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:03,897 INFO L273 TraceCheckUtils]: 86: Hoare triple {27971#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27972#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,897 INFO L273 TraceCheckUtils]: 87: Hoare triple {27972#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27972#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,898 INFO L273 TraceCheckUtils]: 88: Hoare triple {27972#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27972#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:03,899 INFO L273 TraceCheckUtils]: 89: Hoare triple {27972#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27973#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,899 INFO L273 TraceCheckUtils]: 90: Hoare triple {27973#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27973#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,900 INFO L273 TraceCheckUtils]: 91: Hoare triple {27973#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27973#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:03,900 INFO L273 TraceCheckUtils]: 92: Hoare triple {27973#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27974#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,901 INFO L273 TraceCheckUtils]: 93: Hoare triple {27974#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27974#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,901 INFO L273 TraceCheckUtils]: 94: Hoare triple {27974#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27974#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:03,902 INFO L273 TraceCheckUtils]: 95: Hoare triple {27974#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27975#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,903 INFO L273 TraceCheckUtils]: 96: Hoare triple {27975#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27975#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,903 INFO L273 TraceCheckUtils]: 97: Hoare triple {27975#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27975#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:03,904 INFO L273 TraceCheckUtils]: 98: Hoare triple {27975#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27976#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,904 INFO L273 TraceCheckUtils]: 99: Hoare triple {27976#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27976#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,905 INFO L273 TraceCheckUtils]: 100: Hoare triple {27976#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27976#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:03,906 INFO L273 TraceCheckUtils]: 101: Hoare triple {27976#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27977#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,906 INFO L273 TraceCheckUtils]: 102: Hoare triple {27977#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27977#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,907 INFO L273 TraceCheckUtils]: 103: Hoare triple {27977#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27977#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:03,908 INFO L273 TraceCheckUtils]: 104: Hoare triple {27977#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27978#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:03,908 INFO L273 TraceCheckUtils]: 105: Hoare triple {27978#(<= main_~i~0 33)} assume !(~i~0 < 100000); {27944#false} is VALID [2018-11-23 12:00:03,908 INFO L273 TraceCheckUtils]: 106: Hoare triple {27944#false} havoc ~x~0; {27944#false} is VALID [2018-11-23 12:00:03,909 INFO L273 TraceCheckUtils]: 107: Hoare triple {27944#false} assume 0 != ~rv~0;~x~0 := 0; {27944#false} is VALID [2018-11-23 12:00:03,909 INFO L273 TraceCheckUtils]: 108: Hoare triple {27944#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {27944#false} is VALID [2018-11-23 12:00:03,909 INFO L256 TraceCheckUtils]: 109: Hoare triple {27944#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {27944#false} is VALID [2018-11-23 12:00:03,909 INFO L273 TraceCheckUtils]: 110: Hoare triple {27944#false} ~cond := #in~cond; {27944#false} is VALID [2018-11-23 12:00:03,909 INFO L273 TraceCheckUtils]: 111: Hoare triple {27944#false} assume 0 == ~cond; {27944#false} is VALID [2018-11-23 12:00:03,909 INFO L273 TraceCheckUtils]: 112: Hoare triple {27944#false} assume !false; {27944#false} is VALID [2018-11-23 12:00:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:03,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:03,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:03,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:14,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 12:00:14,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:15,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:15,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {27943#true} call ULTIMATE.init(); {27943#true} is VALID [2018-11-23 12:00:15,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {27943#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27943#true} is VALID [2018-11-23 12:00:15,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {27943#true} assume true; {27943#true} is VALID [2018-11-23 12:00:15,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27943#true} {27943#true} #77#return; {27943#true} is VALID [2018-11-23 12:00:15,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {27943#true} call #t~ret9 := main(); {27943#true} is VALID [2018-11-23 12:00:15,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {27943#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {27997#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:15,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {27997#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27997#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:15,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {27997#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27997#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:15,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {27997#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27946#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:15,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {27946#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27946#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:15,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {27946#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27946#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:15,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {27946#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27947#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:15,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {27947#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27947#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:15,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {27947#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27947#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:15,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {27947#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27948#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:15,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {27948#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27948#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:15,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {27948#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27948#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:15,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {27948#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27949#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:15,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {27949#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27949#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:15,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {27949#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27949#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:15,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {27949#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27950#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:15,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {27950#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27950#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:15,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {27950#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27950#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:15,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {27950#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27951#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:15,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {27951#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27951#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:15,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {27951#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27951#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:15,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {27951#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27952#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:15,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {27952#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27952#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:15,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {27952#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27952#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:15,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {27952#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27953#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:15,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {27953#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27953#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:15,260 INFO L273 TraceCheckUtils]: 31: Hoare triple {27953#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27953#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:15,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {27953#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27954#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:15,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {27954#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27954#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:15,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {27954#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27954#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:15,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {27954#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27955#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:15,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {27955#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27955#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:15,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {27955#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27955#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:15,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {27955#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27956#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:15,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {27956#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27956#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:15,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {27956#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27956#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:15,266 INFO L273 TraceCheckUtils]: 41: Hoare triple {27956#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27957#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:15,267 INFO L273 TraceCheckUtils]: 42: Hoare triple {27957#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27957#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:15,267 INFO L273 TraceCheckUtils]: 43: Hoare triple {27957#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27957#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:15,268 INFO L273 TraceCheckUtils]: 44: Hoare triple {27957#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27958#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:15,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {27958#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27958#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:15,269 INFO L273 TraceCheckUtils]: 46: Hoare triple {27958#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27958#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:15,270 INFO L273 TraceCheckUtils]: 47: Hoare triple {27958#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27959#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:15,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {27959#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27959#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:15,271 INFO L273 TraceCheckUtils]: 49: Hoare triple {27959#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27959#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:15,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {27959#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27960#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:15,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {27960#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27960#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:15,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {27960#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27960#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:15,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {27960#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27961#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:15,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {27961#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27961#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:15,275 INFO L273 TraceCheckUtils]: 55: Hoare triple {27961#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27961#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:15,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {27961#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27962#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:15,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {27962#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27962#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:15,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {27962#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27962#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:15,277 INFO L273 TraceCheckUtils]: 59: Hoare triple {27962#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27963#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:15,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {27963#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27963#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:15,278 INFO L273 TraceCheckUtils]: 61: Hoare triple {27963#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27963#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:15,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {27963#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27964#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:15,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {27964#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27964#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:15,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {27964#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27964#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:15,281 INFO L273 TraceCheckUtils]: 65: Hoare triple {27964#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27965#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:15,282 INFO L273 TraceCheckUtils]: 66: Hoare triple {27965#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27965#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:15,282 INFO L273 TraceCheckUtils]: 67: Hoare triple {27965#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27965#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:15,283 INFO L273 TraceCheckUtils]: 68: Hoare triple {27965#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27966#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:15,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {27966#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27966#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:15,284 INFO L273 TraceCheckUtils]: 70: Hoare triple {27966#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27966#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:15,285 INFO L273 TraceCheckUtils]: 71: Hoare triple {27966#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27967#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:15,285 INFO L273 TraceCheckUtils]: 72: Hoare triple {27967#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27967#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:15,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {27967#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27967#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:15,287 INFO L273 TraceCheckUtils]: 74: Hoare triple {27967#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27968#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:15,287 INFO L273 TraceCheckUtils]: 75: Hoare triple {27968#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27968#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:15,288 INFO L273 TraceCheckUtils]: 76: Hoare triple {27968#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27968#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:15,288 INFO L273 TraceCheckUtils]: 77: Hoare triple {27968#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27969#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:15,289 INFO L273 TraceCheckUtils]: 78: Hoare triple {27969#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27969#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:15,289 INFO L273 TraceCheckUtils]: 79: Hoare triple {27969#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27969#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:15,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {27969#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27970#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:15,291 INFO L273 TraceCheckUtils]: 81: Hoare triple {27970#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27970#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:15,291 INFO L273 TraceCheckUtils]: 82: Hoare triple {27970#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27970#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:15,292 INFO L273 TraceCheckUtils]: 83: Hoare triple {27970#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27971#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:15,293 INFO L273 TraceCheckUtils]: 84: Hoare triple {27971#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27971#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:15,293 INFO L273 TraceCheckUtils]: 85: Hoare triple {27971#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27971#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:15,294 INFO L273 TraceCheckUtils]: 86: Hoare triple {27971#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27972#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:15,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {27972#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27972#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:15,295 INFO L273 TraceCheckUtils]: 88: Hoare triple {27972#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27972#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:15,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {27972#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27973#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:15,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {27973#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27973#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:15,297 INFO L273 TraceCheckUtils]: 91: Hoare triple {27973#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27973#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:15,298 INFO L273 TraceCheckUtils]: 92: Hoare triple {27973#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27974#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:15,298 INFO L273 TraceCheckUtils]: 93: Hoare triple {27974#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27974#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:15,299 INFO L273 TraceCheckUtils]: 94: Hoare triple {27974#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27974#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:15,300 INFO L273 TraceCheckUtils]: 95: Hoare triple {27974#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27975#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:15,300 INFO L273 TraceCheckUtils]: 96: Hoare triple {27975#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27975#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:15,301 INFO L273 TraceCheckUtils]: 97: Hoare triple {27975#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27975#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:15,301 INFO L273 TraceCheckUtils]: 98: Hoare triple {27975#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27976#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:15,302 INFO L273 TraceCheckUtils]: 99: Hoare triple {27976#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27976#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:15,302 INFO L273 TraceCheckUtils]: 100: Hoare triple {27976#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27976#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:15,303 INFO L273 TraceCheckUtils]: 101: Hoare triple {27976#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27977#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:15,304 INFO L273 TraceCheckUtils]: 102: Hoare triple {27977#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {27977#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:15,304 INFO L273 TraceCheckUtils]: 103: Hoare triple {27977#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {27977#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:15,305 INFO L273 TraceCheckUtils]: 104: Hoare triple {27977#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {27978#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:15,306 INFO L273 TraceCheckUtils]: 105: Hoare triple {27978#(<= main_~i~0 33)} assume !(~i~0 < 100000); {27944#false} is VALID [2018-11-23 12:00:15,306 INFO L273 TraceCheckUtils]: 106: Hoare triple {27944#false} havoc ~x~0; {27944#false} is VALID [2018-11-23 12:00:15,306 INFO L273 TraceCheckUtils]: 107: Hoare triple {27944#false} assume 0 != ~rv~0;~x~0 := 0; {27944#false} is VALID [2018-11-23 12:00:15,306 INFO L273 TraceCheckUtils]: 108: Hoare triple {27944#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {27944#false} is VALID [2018-11-23 12:00:15,307 INFO L256 TraceCheckUtils]: 109: Hoare triple {27944#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {27944#false} is VALID [2018-11-23 12:00:15,307 INFO L273 TraceCheckUtils]: 110: Hoare triple {27944#false} ~cond := #in~cond; {27944#false} is VALID [2018-11-23 12:00:15,307 INFO L273 TraceCheckUtils]: 111: Hoare triple {27944#false} assume 0 == ~cond; {27944#false} is VALID [2018-11-23 12:00:15,307 INFO L273 TraceCheckUtils]: 112: Hoare triple {27944#false} assume !false; {27944#false} is VALID [2018-11-23 12:00:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:15,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:15,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:00:15,339 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-11-23 12:00:15,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:15,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:00:15,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:15,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:00:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:00:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:00:15,451 INFO L87 Difference]: Start difference. First operand 223 states and 293 transitions. Second operand 37 states. [2018-11-23 12:00:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:15,995 INFO L93 Difference]: Finished difference Result 252 states and 331 transitions. [2018-11-23 12:00:15,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:00:15,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-11-23 12:00:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:00:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 188 transitions. [2018-11-23 12:00:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:00:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 188 transitions. [2018-11-23 12:00:15,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 188 transitions. [2018-11-23 12:00:16,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:16,181 INFO L225 Difference]: With dead ends: 252 [2018-11-23 12:00:16,181 INFO L226 Difference]: Without dead ends: 233 [2018-11-23 12:00:16,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:00:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-23 12:00:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-11-23 12:00:16,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:16,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand 229 states. [2018-11-23 12:00:16,259 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 229 states. [2018-11-23 12:00:16,260 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 229 states. [2018-11-23 12:00:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,264 INFO L93 Difference]: Finished difference Result 233 states and 307 transitions. [2018-11-23 12:00:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2018-11-23 12:00:16,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:16,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:16,265 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 233 states. [2018-11-23 12:00:16,265 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 233 states. [2018-11-23 12:00:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,268 INFO L93 Difference]: Finished difference Result 233 states and 307 transitions. [2018-11-23 12:00:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2018-11-23 12:00:16,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:16,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:16,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:16,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-23 12:00:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 301 transitions. [2018-11-23 12:00:16,272 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 301 transitions. Word has length 113 [2018-11-23 12:00:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:16,273 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 301 transitions. [2018-11-23 12:00:16,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:00:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 301 transitions. [2018-11-23 12:00:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 12:00:16,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:16,274 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:16,274 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:16,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -564525344, now seen corresponding path program 34 times [2018-11-23 12:00:16,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:16,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:17,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {29426#true} call ULTIMATE.init(); {29426#true} is VALID [2018-11-23 12:00:17,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {29426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29426#true} is VALID [2018-11-23 12:00:17,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {29426#true} assume true; {29426#true} is VALID [2018-11-23 12:00:17,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29426#true} {29426#true} #77#return; {29426#true} is VALID [2018-11-23 12:00:17,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {29426#true} call #t~ret9 := main(); {29426#true} is VALID [2018-11-23 12:00:17,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {29426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {29428#(= main_~i~0 0)} is VALID [2018-11-23 12:00:17,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {29428#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29428#(= main_~i~0 0)} is VALID [2018-11-23 12:00:17,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {29428#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29428#(= main_~i~0 0)} is VALID [2018-11-23 12:00:17,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {29428#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29429#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {29429#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29429#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {29429#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29429#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:17,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {29429#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29430#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {29430#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29430#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {29430#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29430#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:17,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {29430#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29431#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {29431#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29431#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {29431#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29431#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:17,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {29431#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29432#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {29432#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29432#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {29432#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29432#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:17,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {29432#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29433#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {29433#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29433#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {29433#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29433#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:17,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {29433#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29434#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {29434#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29434#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {29434#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29434#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:17,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {29434#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29435#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {29435#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29435#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {29435#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29435#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:17,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {29435#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29436#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {29436#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29436#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,905 INFO L273 TraceCheckUtils]: 31: Hoare triple {29436#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29436#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:17,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {29436#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29437#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {29437#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29437#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {29437#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29437#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:17,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {29437#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29438#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {29438#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29438#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {29438#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29438#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:17,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {29438#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29439#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {29439#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29439#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {29439#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29439#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:17,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {29439#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29440#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,912 INFO L273 TraceCheckUtils]: 42: Hoare triple {29440#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29440#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,913 INFO L273 TraceCheckUtils]: 43: Hoare triple {29440#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29440#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:17,913 INFO L273 TraceCheckUtils]: 44: Hoare triple {29440#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29441#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {29441#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29441#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,914 INFO L273 TraceCheckUtils]: 46: Hoare triple {29441#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29441#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:17,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {29441#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29442#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {29442#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29442#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {29442#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29442#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:17,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {29442#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29443#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {29443#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29443#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,918 INFO L273 TraceCheckUtils]: 52: Hoare triple {29443#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29443#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:17,919 INFO L273 TraceCheckUtils]: 53: Hoare triple {29443#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29444#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,919 INFO L273 TraceCheckUtils]: 54: Hoare triple {29444#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29444#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,920 INFO L273 TraceCheckUtils]: 55: Hoare triple {29444#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29444#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:17,921 INFO L273 TraceCheckUtils]: 56: Hoare triple {29444#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29445#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,921 INFO L273 TraceCheckUtils]: 57: Hoare triple {29445#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29445#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {29445#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29445#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:17,922 INFO L273 TraceCheckUtils]: 59: Hoare triple {29445#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29446#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,923 INFO L273 TraceCheckUtils]: 60: Hoare triple {29446#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29446#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,923 INFO L273 TraceCheckUtils]: 61: Hoare triple {29446#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29446#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:17,924 INFO L273 TraceCheckUtils]: 62: Hoare triple {29446#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29447#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,925 INFO L273 TraceCheckUtils]: 63: Hoare triple {29447#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29447#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,925 INFO L273 TraceCheckUtils]: 64: Hoare triple {29447#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29447#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:17,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {29447#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29448#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,927 INFO L273 TraceCheckUtils]: 66: Hoare triple {29448#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29448#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,927 INFO L273 TraceCheckUtils]: 67: Hoare triple {29448#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29448#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:17,928 INFO L273 TraceCheckUtils]: 68: Hoare triple {29448#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29449#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,928 INFO L273 TraceCheckUtils]: 69: Hoare triple {29449#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29449#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,929 INFO L273 TraceCheckUtils]: 70: Hoare triple {29449#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29449#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:17,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {29449#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29450#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {29450#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29450#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {29450#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29450#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:17,932 INFO L273 TraceCheckUtils]: 74: Hoare triple {29450#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29451#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {29451#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29451#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,932 INFO L273 TraceCheckUtils]: 76: Hoare triple {29451#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29451#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:17,933 INFO L273 TraceCheckUtils]: 77: Hoare triple {29451#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29452#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,934 INFO L273 TraceCheckUtils]: 78: Hoare triple {29452#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29452#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,934 INFO L273 TraceCheckUtils]: 79: Hoare triple {29452#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29452#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:17,935 INFO L273 TraceCheckUtils]: 80: Hoare triple {29452#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29453#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,936 INFO L273 TraceCheckUtils]: 81: Hoare triple {29453#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29453#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,936 INFO L273 TraceCheckUtils]: 82: Hoare triple {29453#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29453#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:17,937 INFO L273 TraceCheckUtils]: 83: Hoare triple {29453#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29454#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,937 INFO L273 TraceCheckUtils]: 84: Hoare triple {29454#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29454#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,938 INFO L273 TraceCheckUtils]: 85: Hoare triple {29454#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29454#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:17,939 INFO L273 TraceCheckUtils]: 86: Hoare triple {29454#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29455#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,939 INFO L273 TraceCheckUtils]: 87: Hoare triple {29455#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29455#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,940 INFO L273 TraceCheckUtils]: 88: Hoare triple {29455#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29455#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:17,941 INFO L273 TraceCheckUtils]: 89: Hoare triple {29455#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29456#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,941 INFO L273 TraceCheckUtils]: 90: Hoare triple {29456#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29456#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,942 INFO L273 TraceCheckUtils]: 91: Hoare triple {29456#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29456#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:17,943 INFO L273 TraceCheckUtils]: 92: Hoare triple {29456#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29457#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,943 INFO L273 TraceCheckUtils]: 93: Hoare triple {29457#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29457#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,944 INFO L273 TraceCheckUtils]: 94: Hoare triple {29457#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29457#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:17,945 INFO L273 TraceCheckUtils]: 95: Hoare triple {29457#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29458#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,945 INFO L273 TraceCheckUtils]: 96: Hoare triple {29458#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29458#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,946 INFO L273 TraceCheckUtils]: 97: Hoare triple {29458#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29458#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:17,947 INFO L273 TraceCheckUtils]: 98: Hoare triple {29458#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29459#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,947 INFO L273 TraceCheckUtils]: 99: Hoare triple {29459#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29459#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,948 INFO L273 TraceCheckUtils]: 100: Hoare triple {29459#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29459#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:17,949 INFO L273 TraceCheckUtils]: 101: Hoare triple {29459#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29460#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,949 INFO L273 TraceCheckUtils]: 102: Hoare triple {29460#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29460#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,950 INFO L273 TraceCheckUtils]: 103: Hoare triple {29460#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29460#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:17,951 INFO L273 TraceCheckUtils]: 104: Hoare triple {29460#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29461#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,951 INFO L273 TraceCheckUtils]: 105: Hoare triple {29461#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29461#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,952 INFO L273 TraceCheckUtils]: 106: Hoare triple {29461#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29461#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:17,953 INFO L273 TraceCheckUtils]: 107: Hoare triple {29461#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29462#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:17,953 INFO L273 TraceCheckUtils]: 108: Hoare triple {29462#(<= main_~i~0 34)} assume !(~i~0 < 100000); {29427#false} is VALID [2018-11-23 12:00:17,953 INFO L273 TraceCheckUtils]: 109: Hoare triple {29427#false} havoc ~x~0; {29427#false} is VALID [2018-11-23 12:00:17,954 INFO L273 TraceCheckUtils]: 110: Hoare triple {29427#false} assume 0 != ~rv~0;~x~0 := 0; {29427#false} is VALID [2018-11-23 12:00:17,954 INFO L273 TraceCheckUtils]: 111: Hoare triple {29427#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {29427#false} is VALID [2018-11-23 12:00:17,954 INFO L256 TraceCheckUtils]: 112: Hoare triple {29427#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {29427#false} is VALID [2018-11-23 12:00:17,954 INFO L273 TraceCheckUtils]: 113: Hoare triple {29427#false} ~cond := #in~cond; {29427#false} is VALID [2018-11-23 12:00:17,954 INFO L273 TraceCheckUtils]: 114: Hoare triple {29427#false} assume 0 == ~cond; {29427#false} is VALID [2018-11-23 12:00:17,955 INFO L273 TraceCheckUtils]: 115: Hoare triple {29427#false} assume !false; {29427#false} is VALID [2018-11-23 12:00:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:17,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:17,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:18,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:18,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:18,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:18,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {29426#true} call ULTIMATE.init(); {29426#true} is VALID [2018-11-23 12:00:18,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {29426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29426#true} is VALID [2018-11-23 12:00:18,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {29426#true} assume true; {29426#true} is VALID [2018-11-23 12:00:18,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29426#true} {29426#true} #77#return; {29426#true} is VALID [2018-11-23 12:00:18,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {29426#true} call #t~ret9 := main(); {29426#true} is VALID [2018-11-23 12:00:18,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {29426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {29481#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:18,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {29481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29481#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:18,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {29481#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29481#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:18,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {29481#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29429#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:18,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {29429#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29429#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:18,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {29429#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29429#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:18,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {29429#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29430#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {29430#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29430#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,556 INFO L273 TraceCheckUtils]: 13: Hoare triple {29430#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29430#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,557 INFO L273 TraceCheckUtils]: 14: Hoare triple {29430#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29431#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {29431#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29431#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {29431#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29431#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {29431#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29432#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,559 INFO L273 TraceCheckUtils]: 18: Hoare triple {29432#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29432#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {29432#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29432#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {29432#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29433#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {29433#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29433#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {29433#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29433#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {29433#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29434#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {29434#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29434#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {29434#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29434#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {29434#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29435#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,565 INFO L273 TraceCheckUtils]: 27: Hoare triple {29435#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29435#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {29435#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29435#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {29435#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29436#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {29436#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29436#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {29436#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29436#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {29436#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29437#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {29437#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29437#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {29437#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29437#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {29437#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29438#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {29438#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29438#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {29438#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29438#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {29438#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29439#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {29439#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29439#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {29439#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29439#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {29439#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29440#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {29440#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29440#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {29440#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29440#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {29440#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29441#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {29441#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29441#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {29441#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29441#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,577 INFO L273 TraceCheckUtils]: 47: Hoare triple {29441#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29442#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {29442#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29442#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {29442#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29442#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {29442#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29443#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {29443#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29443#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {29443#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29443#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,581 INFO L273 TraceCheckUtils]: 53: Hoare triple {29443#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29444#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {29444#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29444#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,582 INFO L273 TraceCheckUtils]: 55: Hoare triple {29444#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29444#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {29444#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29445#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,583 INFO L273 TraceCheckUtils]: 57: Hoare triple {29445#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29445#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,583 INFO L273 TraceCheckUtils]: 58: Hoare triple {29445#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29445#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,584 INFO L273 TraceCheckUtils]: 59: Hoare triple {29445#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29446#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,585 INFO L273 TraceCheckUtils]: 60: Hoare triple {29446#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29446#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,585 INFO L273 TraceCheckUtils]: 61: Hoare triple {29446#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29446#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,586 INFO L273 TraceCheckUtils]: 62: Hoare triple {29446#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29447#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,587 INFO L273 TraceCheckUtils]: 63: Hoare triple {29447#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29447#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,587 INFO L273 TraceCheckUtils]: 64: Hoare triple {29447#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29447#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,588 INFO L273 TraceCheckUtils]: 65: Hoare triple {29447#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29448#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,588 INFO L273 TraceCheckUtils]: 66: Hoare triple {29448#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29448#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,589 INFO L273 TraceCheckUtils]: 67: Hoare triple {29448#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29448#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,590 INFO L273 TraceCheckUtils]: 68: Hoare triple {29448#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29449#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,590 INFO L273 TraceCheckUtils]: 69: Hoare triple {29449#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29449#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,591 INFO L273 TraceCheckUtils]: 70: Hoare triple {29449#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29449#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,591 INFO L273 TraceCheckUtils]: 71: Hoare triple {29449#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29450#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:18,592 INFO L273 TraceCheckUtils]: 72: Hoare triple {29450#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29450#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:18,592 INFO L273 TraceCheckUtils]: 73: Hoare triple {29450#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29450#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:18,593 INFO L273 TraceCheckUtils]: 74: Hoare triple {29450#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29451#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:18,594 INFO L273 TraceCheckUtils]: 75: Hoare triple {29451#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29451#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:18,594 INFO L273 TraceCheckUtils]: 76: Hoare triple {29451#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29451#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:18,595 INFO L273 TraceCheckUtils]: 77: Hoare triple {29451#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29452#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:18,596 INFO L273 TraceCheckUtils]: 78: Hoare triple {29452#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29452#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:18,596 INFO L273 TraceCheckUtils]: 79: Hoare triple {29452#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29452#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:18,597 INFO L273 TraceCheckUtils]: 80: Hoare triple {29452#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29453#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:18,597 INFO L273 TraceCheckUtils]: 81: Hoare triple {29453#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29453#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:18,598 INFO L273 TraceCheckUtils]: 82: Hoare triple {29453#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29453#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:18,599 INFO L273 TraceCheckUtils]: 83: Hoare triple {29453#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29454#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:18,599 INFO L273 TraceCheckUtils]: 84: Hoare triple {29454#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29454#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:18,600 INFO L273 TraceCheckUtils]: 85: Hoare triple {29454#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29454#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:18,601 INFO L273 TraceCheckUtils]: 86: Hoare triple {29454#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29455#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:18,601 INFO L273 TraceCheckUtils]: 87: Hoare triple {29455#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29455#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:18,602 INFO L273 TraceCheckUtils]: 88: Hoare triple {29455#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29455#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:18,602 INFO L273 TraceCheckUtils]: 89: Hoare triple {29455#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29456#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:18,603 INFO L273 TraceCheckUtils]: 90: Hoare triple {29456#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29456#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:18,603 INFO L273 TraceCheckUtils]: 91: Hoare triple {29456#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29456#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:18,604 INFO L273 TraceCheckUtils]: 92: Hoare triple {29456#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29457#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:18,605 INFO L273 TraceCheckUtils]: 93: Hoare triple {29457#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29457#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:18,605 INFO L273 TraceCheckUtils]: 94: Hoare triple {29457#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29457#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:18,606 INFO L273 TraceCheckUtils]: 95: Hoare triple {29457#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29458#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:18,606 INFO L273 TraceCheckUtils]: 96: Hoare triple {29458#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29458#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:18,607 INFO L273 TraceCheckUtils]: 97: Hoare triple {29458#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29458#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:18,608 INFO L273 TraceCheckUtils]: 98: Hoare triple {29458#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29459#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:18,608 INFO L273 TraceCheckUtils]: 99: Hoare triple {29459#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29459#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:18,609 INFO L273 TraceCheckUtils]: 100: Hoare triple {29459#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29459#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:18,610 INFO L273 TraceCheckUtils]: 101: Hoare triple {29459#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29460#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:18,610 INFO L273 TraceCheckUtils]: 102: Hoare triple {29460#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29460#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:18,611 INFO L273 TraceCheckUtils]: 103: Hoare triple {29460#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29460#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:18,612 INFO L273 TraceCheckUtils]: 104: Hoare triple {29460#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29461#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:18,612 INFO L273 TraceCheckUtils]: 105: Hoare triple {29461#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {29461#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:18,613 INFO L273 TraceCheckUtils]: 106: Hoare triple {29461#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {29461#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:18,613 INFO L273 TraceCheckUtils]: 107: Hoare triple {29461#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {29462#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:18,614 INFO L273 TraceCheckUtils]: 108: Hoare triple {29462#(<= main_~i~0 34)} assume !(~i~0 < 100000); {29427#false} is VALID [2018-11-23 12:00:18,614 INFO L273 TraceCheckUtils]: 109: Hoare triple {29427#false} havoc ~x~0; {29427#false} is VALID [2018-11-23 12:00:18,614 INFO L273 TraceCheckUtils]: 110: Hoare triple {29427#false} assume 0 != ~rv~0;~x~0 := 0; {29427#false} is VALID [2018-11-23 12:00:18,615 INFO L273 TraceCheckUtils]: 111: Hoare triple {29427#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {29427#false} is VALID [2018-11-23 12:00:18,615 INFO L256 TraceCheckUtils]: 112: Hoare triple {29427#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {29427#false} is VALID [2018-11-23 12:00:18,615 INFO L273 TraceCheckUtils]: 113: Hoare triple {29427#false} ~cond := #in~cond; {29427#false} is VALID [2018-11-23 12:00:18,615 INFO L273 TraceCheckUtils]: 114: Hoare triple {29427#false} assume 0 == ~cond; {29427#false} is VALID [2018-11-23 12:00:18,615 INFO L273 TraceCheckUtils]: 115: Hoare triple {29427#false} assume !false; {29427#false} is VALID [2018-11-23 12:00:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:18,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:18,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:00:18,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2018-11-23 12:00:18,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:18,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:00:18,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:18,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:00:18,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:00:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:00:18,764 INFO L87 Difference]: Start difference. First operand 229 states and 301 transitions. Second operand 38 states. [2018-11-23 12:00:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:19,522 INFO L93 Difference]: Finished difference Result 258 states and 339 transitions. [2018-11-23 12:00:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:00:19,522 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2018-11-23 12:00:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:00:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 192 transitions. [2018-11-23 12:00:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:00:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 192 transitions. [2018-11-23 12:00:19,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 192 transitions. [2018-11-23 12:00:19,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:19,765 INFO L225 Difference]: With dead ends: 258 [2018-11-23 12:00:19,765 INFO L226 Difference]: Without dead ends: 239 [2018-11-23 12:00:19,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:00:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-23 12:00:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2018-11-23 12:00:19,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:19,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 235 states. [2018-11-23 12:00:19,983 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 235 states. [2018-11-23 12:00:19,984 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 235 states. [2018-11-23 12:00:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:19,988 INFO L93 Difference]: Finished difference Result 239 states and 315 transitions. [2018-11-23 12:00:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 315 transitions. [2018-11-23 12:00:19,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:19,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:19,989 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 239 states. [2018-11-23 12:00:19,989 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 239 states. [2018-11-23 12:00:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:19,992 INFO L93 Difference]: Finished difference Result 239 states and 315 transitions. [2018-11-23 12:00:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 315 transitions. [2018-11-23 12:00:19,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:19,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:19,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:19,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-23 12:00:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-11-23 12:00:19,998 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 116 [2018-11-23 12:00:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:19,998 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-11-23 12:00:19,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:00:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-11-23 12:00:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 12:00:19,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:19,999 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:20,000 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:20,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1430527008, now seen corresponding path program 35 times [2018-11-23 12:00:20,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:20,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:20,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {30947#true} call ULTIMATE.init(); {30947#true} is VALID [2018-11-23 12:00:20,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {30947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30947#true} is VALID [2018-11-23 12:00:20,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {30947#true} assume true; {30947#true} is VALID [2018-11-23 12:00:20,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30947#true} {30947#true} #77#return; {30947#true} is VALID [2018-11-23 12:00:20,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {30947#true} call #t~ret9 := main(); {30947#true} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {30947#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {30949#(= main_~i~0 0)} is VALID [2018-11-23 12:00:20,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {30949#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30949#(= main_~i~0 0)} is VALID [2018-11-23 12:00:20,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {30949#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30949#(= main_~i~0 0)} is VALID [2018-11-23 12:00:20,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {30949#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30950#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:20,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {30950#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30950#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:20,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {30950#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30950#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:20,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {30950#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30951#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:20,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {30951#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30951#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:20,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {30951#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30951#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:20,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {30951#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30952#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:20,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {30952#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30952#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:20,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {30952#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30952#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:20,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {30952#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30953#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:20,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {30953#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30953#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:20,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {30953#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30953#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:20,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {30953#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30954#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:20,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {30954#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30954#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:20,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {30954#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30954#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:20,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {30954#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30955#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:20,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {30955#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30955#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:20,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {30955#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30955#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:20,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {30955#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30956#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:20,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {30956#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30956#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:20,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {30956#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30956#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:20,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {30956#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30957#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:20,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {30957#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30957#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:20,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {30957#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30957#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:20,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {30957#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30958#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:20,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {30958#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30958#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:20,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {30958#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30958#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:20,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {30958#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30959#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:20,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {30959#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30959#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:20,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {30959#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30959#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:20,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {30959#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30960#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:20,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {30960#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30960#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:20,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {30960#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30960#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:20,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {30960#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30961#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:20,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {30961#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30961#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:20,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {30961#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30961#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:20,963 INFO L273 TraceCheckUtils]: 44: Hoare triple {30961#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30962#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:20,964 INFO L273 TraceCheckUtils]: 45: Hoare triple {30962#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30962#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:20,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {30962#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30962#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:20,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {30962#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30963#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:20,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {30963#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30963#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:20,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {30963#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30963#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:20,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {30963#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30964#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:20,968 INFO L273 TraceCheckUtils]: 51: Hoare triple {30964#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30964#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:20,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {30964#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30964#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:20,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {30964#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30965#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:20,970 INFO L273 TraceCheckUtils]: 54: Hoare triple {30965#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30965#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:20,970 INFO L273 TraceCheckUtils]: 55: Hoare triple {30965#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30965#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:20,971 INFO L273 TraceCheckUtils]: 56: Hoare triple {30965#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30966#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:20,971 INFO L273 TraceCheckUtils]: 57: Hoare triple {30966#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30966#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:20,972 INFO L273 TraceCheckUtils]: 58: Hoare triple {30966#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30966#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:20,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {30966#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30967#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:20,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {30967#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30967#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:20,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {30967#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30967#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:20,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {30967#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30968#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:20,975 INFO L273 TraceCheckUtils]: 63: Hoare triple {30968#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30968#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:20,976 INFO L273 TraceCheckUtils]: 64: Hoare triple {30968#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30968#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:20,977 INFO L273 TraceCheckUtils]: 65: Hoare triple {30968#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30969#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:20,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {30969#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30969#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:20,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {30969#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30969#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:20,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {30969#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30970#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:20,979 INFO L273 TraceCheckUtils]: 69: Hoare triple {30970#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30970#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:20,980 INFO L273 TraceCheckUtils]: 70: Hoare triple {30970#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30970#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:20,981 INFO L273 TraceCheckUtils]: 71: Hoare triple {30970#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30971#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:20,981 INFO L273 TraceCheckUtils]: 72: Hoare triple {30971#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30971#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:20,982 INFO L273 TraceCheckUtils]: 73: Hoare triple {30971#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30971#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:20,983 INFO L273 TraceCheckUtils]: 74: Hoare triple {30971#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30972#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:20,983 INFO L273 TraceCheckUtils]: 75: Hoare triple {30972#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30972#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:20,984 INFO L273 TraceCheckUtils]: 76: Hoare triple {30972#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30972#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:20,985 INFO L273 TraceCheckUtils]: 77: Hoare triple {30972#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30973#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:20,985 INFO L273 TraceCheckUtils]: 78: Hoare triple {30973#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30973#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:20,986 INFO L273 TraceCheckUtils]: 79: Hoare triple {30973#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30973#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:20,986 INFO L273 TraceCheckUtils]: 80: Hoare triple {30973#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30974#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:20,987 INFO L273 TraceCheckUtils]: 81: Hoare triple {30974#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30974#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:20,987 INFO L273 TraceCheckUtils]: 82: Hoare triple {30974#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30974#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:20,988 INFO L273 TraceCheckUtils]: 83: Hoare triple {30974#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30975#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:20,989 INFO L273 TraceCheckUtils]: 84: Hoare triple {30975#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30975#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:20,989 INFO L273 TraceCheckUtils]: 85: Hoare triple {30975#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30975#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:20,990 INFO L273 TraceCheckUtils]: 86: Hoare triple {30975#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30976#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:20,991 INFO L273 TraceCheckUtils]: 87: Hoare triple {30976#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30976#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:20,991 INFO L273 TraceCheckUtils]: 88: Hoare triple {30976#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30976#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:20,992 INFO L273 TraceCheckUtils]: 89: Hoare triple {30976#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30977#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:20,993 INFO L273 TraceCheckUtils]: 90: Hoare triple {30977#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30977#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:20,993 INFO L273 TraceCheckUtils]: 91: Hoare triple {30977#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30977#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:20,994 INFO L273 TraceCheckUtils]: 92: Hoare triple {30977#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30978#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:20,995 INFO L273 TraceCheckUtils]: 93: Hoare triple {30978#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30978#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:20,995 INFO L273 TraceCheckUtils]: 94: Hoare triple {30978#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30978#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:20,996 INFO L273 TraceCheckUtils]: 95: Hoare triple {30978#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30979#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:20,997 INFO L273 TraceCheckUtils]: 96: Hoare triple {30979#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30979#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:20,997 INFO L273 TraceCheckUtils]: 97: Hoare triple {30979#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30979#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:20,998 INFO L273 TraceCheckUtils]: 98: Hoare triple {30979#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30980#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:20,999 INFO L273 TraceCheckUtils]: 99: Hoare triple {30980#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30980#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:20,999 INFO L273 TraceCheckUtils]: 100: Hoare triple {30980#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30980#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:21,000 INFO L273 TraceCheckUtils]: 101: Hoare triple {30980#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30981#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:21,001 INFO L273 TraceCheckUtils]: 102: Hoare triple {30981#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30981#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:21,001 INFO L273 TraceCheckUtils]: 103: Hoare triple {30981#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30981#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:21,002 INFO L273 TraceCheckUtils]: 104: Hoare triple {30981#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30982#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:21,002 INFO L273 TraceCheckUtils]: 105: Hoare triple {30982#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30982#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:21,003 INFO L273 TraceCheckUtils]: 106: Hoare triple {30982#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30982#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:21,004 INFO L273 TraceCheckUtils]: 107: Hoare triple {30982#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30983#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:21,004 INFO L273 TraceCheckUtils]: 108: Hoare triple {30983#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30983#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:21,005 INFO L273 TraceCheckUtils]: 109: Hoare triple {30983#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30983#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:21,006 INFO L273 TraceCheckUtils]: 110: Hoare triple {30983#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30984#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:21,006 INFO L273 TraceCheckUtils]: 111: Hoare triple {30984#(<= main_~i~0 35)} assume !(~i~0 < 100000); {30948#false} is VALID [2018-11-23 12:00:21,007 INFO L273 TraceCheckUtils]: 112: Hoare triple {30948#false} havoc ~x~0; {30948#false} is VALID [2018-11-23 12:00:21,007 INFO L273 TraceCheckUtils]: 113: Hoare triple {30948#false} assume 0 != ~rv~0;~x~0 := 0; {30948#false} is VALID [2018-11-23 12:00:21,007 INFO L273 TraceCheckUtils]: 114: Hoare triple {30948#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {30948#false} is VALID [2018-11-23 12:00:21,007 INFO L256 TraceCheckUtils]: 115: Hoare triple {30948#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {30948#false} is VALID [2018-11-23 12:00:21,007 INFO L273 TraceCheckUtils]: 116: Hoare triple {30948#false} ~cond := #in~cond; {30948#false} is VALID [2018-11-23 12:00:21,008 INFO L273 TraceCheckUtils]: 117: Hoare triple {30948#false} assume 0 == ~cond; {30948#false} is VALID [2018-11-23 12:00:21,008 INFO L273 TraceCheckUtils]: 118: Hoare triple {30948#false} assume !false; {30948#false} is VALID [2018-11-23 12:00:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:21,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:21,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:32,120 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:00:32,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:32,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:32,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {30947#true} call ULTIMATE.init(); {30947#true} is VALID [2018-11-23 12:00:32,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {30947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30947#true} is VALID [2018-11-23 12:00:32,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {30947#true} assume true; {30947#true} is VALID [2018-11-23 12:00:32,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30947#true} {30947#true} #77#return; {30947#true} is VALID [2018-11-23 12:00:32,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {30947#true} call #t~ret9 := main(); {30947#true} is VALID [2018-11-23 12:00:32,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {30947#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {31003#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:32,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {31003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {31003#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:32,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {31003#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {31003#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:32,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {31003#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30950#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:32,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {30950#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30950#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:32,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {30950#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30950#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:32,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {30950#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30951#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {30951#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30951#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {30951#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30951#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {30951#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30952#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {30952#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30952#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {30952#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30952#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {30952#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30953#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {30953#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30953#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {30953#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30953#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {30953#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30954#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {30954#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30954#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {30954#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30954#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {30954#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30955#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {30955#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30955#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {30955#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30955#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {30955#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30956#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {30956#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30956#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {30956#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30956#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {30956#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30957#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {30957#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30957#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {30957#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30957#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {30957#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30958#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {30958#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30958#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {30958#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30958#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {30958#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30959#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {30959#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30959#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {30959#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30959#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,428 INFO L273 TraceCheckUtils]: 38: Hoare triple {30959#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30960#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {30960#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30960#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,429 INFO L273 TraceCheckUtils]: 40: Hoare triple {30960#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30960#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,430 INFO L273 TraceCheckUtils]: 41: Hoare triple {30960#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30961#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,430 INFO L273 TraceCheckUtils]: 42: Hoare triple {30961#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30961#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,431 INFO L273 TraceCheckUtils]: 43: Hoare triple {30961#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30961#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,432 INFO L273 TraceCheckUtils]: 44: Hoare triple {30961#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30962#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,432 INFO L273 TraceCheckUtils]: 45: Hoare triple {30962#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30962#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {30962#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30962#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {30962#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30963#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {30963#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30963#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {30963#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30963#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,436 INFO L273 TraceCheckUtils]: 50: Hoare triple {30963#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30964#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,436 INFO L273 TraceCheckUtils]: 51: Hoare triple {30964#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30964#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,437 INFO L273 TraceCheckUtils]: 52: Hoare triple {30964#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30964#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,437 INFO L273 TraceCheckUtils]: 53: Hoare triple {30964#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30965#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {30965#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30965#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {30965#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30965#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,442 INFO L273 TraceCheckUtils]: 56: Hoare triple {30965#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30966#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {30966#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30966#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {30966#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30966#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {30966#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30967#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,444 INFO L273 TraceCheckUtils]: 60: Hoare triple {30967#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30967#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,444 INFO L273 TraceCheckUtils]: 61: Hoare triple {30967#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30967#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,445 INFO L273 TraceCheckUtils]: 62: Hoare triple {30967#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30968#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,445 INFO L273 TraceCheckUtils]: 63: Hoare triple {30968#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30968#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,446 INFO L273 TraceCheckUtils]: 64: Hoare triple {30968#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30968#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {30968#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30969#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,447 INFO L273 TraceCheckUtils]: 66: Hoare triple {30969#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30969#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {30969#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30969#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {30969#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30970#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {30970#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30970#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,449 INFO L273 TraceCheckUtils]: 70: Hoare triple {30970#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30970#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,450 INFO L273 TraceCheckUtils]: 71: Hoare triple {30970#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30971#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {30971#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30971#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,451 INFO L273 TraceCheckUtils]: 73: Hoare triple {30971#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30971#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {30971#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30972#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {30972#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30972#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {30972#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30972#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {30972#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30973#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,455 INFO L273 TraceCheckUtils]: 78: Hoare triple {30973#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30973#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {30973#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30973#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,456 INFO L273 TraceCheckUtils]: 80: Hoare triple {30973#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30974#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,456 INFO L273 TraceCheckUtils]: 81: Hoare triple {30974#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30974#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,457 INFO L273 TraceCheckUtils]: 82: Hoare triple {30974#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30974#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,458 INFO L273 TraceCheckUtils]: 83: Hoare triple {30974#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30975#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,458 INFO L273 TraceCheckUtils]: 84: Hoare triple {30975#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30975#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,459 INFO L273 TraceCheckUtils]: 85: Hoare triple {30975#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30975#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,460 INFO L273 TraceCheckUtils]: 86: Hoare triple {30975#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30976#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,460 INFO L273 TraceCheckUtils]: 87: Hoare triple {30976#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30976#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,461 INFO L273 TraceCheckUtils]: 88: Hoare triple {30976#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30976#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,462 INFO L273 TraceCheckUtils]: 89: Hoare triple {30976#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30977#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,462 INFO L273 TraceCheckUtils]: 90: Hoare triple {30977#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30977#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,463 INFO L273 TraceCheckUtils]: 91: Hoare triple {30977#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30977#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,463 INFO L273 TraceCheckUtils]: 92: Hoare triple {30977#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30978#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,464 INFO L273 TraceCheckUtils]: 93: Hoare triple {30978#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30978#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,464 INFO L273 TraceCheckUtils]: 94: Hoare triple {30978#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30978#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,465 INFO L273 TraceCheckUtils]: 95: Hoare triple {30978#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30979#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,466 INFO L273 TraceCheckUtils]: 96: Hoare triple {30979#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30979#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,466 INFO L273 TraceCheckUtils]: 97: Hoare triple {30979#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30979#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,467 INFO L273 TraceCheckUtils]: 98: Hoare triple {30979#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30980#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,468 INFO L273 TraceCheckUtils]: 99: Hoare triple {30980#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30980#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,468 INFO L273 TraceCheckUtils]: 100: Hoare triple {30980#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30980#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,469 INFO L273 TraceCheckUtils]: 101: Hoare triple {30980#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30981#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,470 INFO L273 TraceCheckUtils]: 102: Hoare triple {30981#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30981#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,470 INFO L273 TraceCheckUtils]: 103: Hoare triple {30981#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30981#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,471 INFO L273 TraceCheckUtils]: 104: Hoare triple {30981#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30982#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,472 INFO L273 TraceCheckUtils]: 105: Hoare triple {30982#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30982#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,472 INFO L273 TraceCheckUtils]: 106: Hoare triple {30982#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30982#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,473 INFO L273 TraceCheckUtils]: 107: Hoare triple {30982#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30983#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,473 INFO L273 TraceCheckUtils]: 108: Hoare triple {30983#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {30983#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,474 INFO L273 TraceCheckUtils]: 109: Hoare triple {30983#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {30983#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,475 INFO L273 TraceCheckUtils]: 110: Hoare triple {30983#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {30984#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,475 INFO L273 TraceCheckUtils]: 111: Hoare triple {30984#(<= main_~i~0 35)} assume !(~i~0 < 100000); {30948#false} is VALID [2018-11-23 12:00:32,476 INFO L273 TraceCheckUtils]: 112: Hoare triple {30948#false} havoc ~x~0; {30948#false} is VALID [2018-11-23 12:00:32,476 INFO L273 TraceCheckUtils]: 113: Hoare triple {30948#false} assume 0 != ~rv~0;~x~0 := 0; {30948#false} is VALID [2018-11-23 12:00:32,476 INFO L273 TraceCheckUtils]: 114: Hoare triple {30948#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {30948#false} is VALID [2018-11-23 12:00:32,476 INFO L256 TraceCheckUtils]: 115: Hoare triple {30948#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {30948#false} is VALID [2018-11-23 12:00:32,476 INFO L273 TraceCheckUtils]: 116: Hoare triple {30948#false} ~cond := #in~cond; {30948#false} is VALID [2018-11-23 12:00:32,477 INFO L273 TraceCheckUtils]: 117: Hoare triple {30948#false} assume 0 == ~cond; {30948#false} is VALID [2018-11-23 12:00:32,477 INFO L273 TraceCheckUtils]: 118: Hoare triple {30948#false} assume !false; {30948#false} is VALID [2018-11-23 12:00:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:32,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:32,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:00:32,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2018-11-23 12:00:32,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:32,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:00:32,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:32,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:00:32,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:00:32,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:00:32,633 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 39 states. [2018-11-23 12:00:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:33,193 INFO L93 Difference]: Finished difference Result 264 states and 347 transitions. [2018-11-23 12:00:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:00:33,193 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2018-11-23 12:00:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:00:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 196 transitions. [2018-11-23 12:00:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:00:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 196 transitions. [2018-11-23 12:00:33,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 196 transitions. [2018-11-23 12:00:33,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:33,384 INFO L225 Difference]: With dead ends: 264 [2018-11-23 12:00:33,384 INFO L226 Difference]: Without dead ends: 245 [2018-11-23 12:00:33,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:00:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-23 12:00:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-11-23 12:00:33,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:33,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand 241 states. [2018-11-23 12:00:33,462 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 241 states. [2018-11-23 12:00:33,462 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 241 states. [2018-11-23 12:00:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:33,467 INFO L93 Difference]: Finished difference Result 245 states and 323 transitions. [2018-11-23 12:00:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2018-11-23 12:00:33,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:33,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:33,468 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 245 states. [2018-11-23 12:00:33,468 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 245 states. [2018-11-23 12:00:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:33,471 INFO L93 Difference]: Finished difference Result 245 states and 323 transitions. [2018-11-23 12:00:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2018-11-23 12:00:33,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:33,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:33,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:33,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-23 12:00:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 317 transitions. [2018-11-23 12:00:33,477 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 317 transitions. Word has length 119 [2018-11-23 12:00:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:33,477 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 317 transitions. [2018-11-23 12:00:33,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:00:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 317 transitions. [2018-11-23 12:00:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:00:33,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:33,478 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:33,478 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:33,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2017263904, now seen corresponding path program 36 times [2018-11-23 12:00:33,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:33,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:33,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:34,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {32506#true} call ULTIMATE.init(); {32506#true} is VALID [2018-11-23 12:00:34,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {32506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32506#true} is VALID [2018-11-23 12:00:34,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {32506#true} assume true; {32506#true} is VALID [2018-11-23 12:00:34,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32506#true} {32506#true} #77#return; {32506#true} is VALID [2018-11-23 12:00:34,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {32506#true} call #t~ret9 := main(); {32506#true} is VALID [2018-11-23 12:00:34,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {32506#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {32508#(= main_~i~0 0)} is VALID [2018-11-23 12:00:34,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {32508#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32508#(= main_~i~0 0)} is VALID [2018-11-23 12:00:34,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {32508#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32508#(= main_~i~0 0)} is VALID [2018-11-23 12:00:34,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {32508#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:34,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {32509#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:34,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {32509#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32509#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:34,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {32509#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:34,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {32510#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:34,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {32510#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32510#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:34,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {32510#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:34,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {32511#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:34,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {32511#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32511#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:34,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {32511#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:34,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {32512#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:34,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {32512#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32512#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:34,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {32512#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:34,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {32513#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:34,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {32513#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32513#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:34,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {32513#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:34,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {32514#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:34,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {32514#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32514#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:34,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {32514#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:34,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {32515#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:34,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {32515#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32515#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:34,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {32515#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:34,443 INFO L273 TraceCheckUtils]: 30: Hoare triple {32516#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:34,444 INFO L273 TraceCheckUtils]: 31: Hoare triple {32516#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32516#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:34,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {32516#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:34,445 INFO L273 TraceCheckUtils]: 33: Hoare triple {32517#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:34,445 INFO L273 TraceCheckUtils]: 34: Hoare triple {32517#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32517#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:34,446 INFO L273 TraceCheckUtils]: 35: Hoare triple {32517#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:34,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {32518#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:34,447 INFO L273 TraceCheckUtils]: 37: Hoare triple {32518#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32518#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:34,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {32518#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:34,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {32519#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:34,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {32519#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32519#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:34,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {32519#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:34,450 INFO L273 TraceCheckUtils]: 42: Hoare triple {32520#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:34,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {32520#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32520#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:34,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {32520#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:34,452 INFO L273 TraceCheckUtils]: 45: Hoare triple {32521#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:34,453 INFO L273 TraceCheckUtils]: 46: Hoare triple {32521#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32521#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:34,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {32521#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:34,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {32522#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:34,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {32522#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32522#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:34,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {32522#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:34,456 INFO L273 TraceCheckUtils]: 51: Hoare triple {32523#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:34,456 INFO L273 TraceCheckUtils]: 52: Hoare triple {32523#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32523#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:34,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {32523#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:34,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {32524#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:34,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {32524#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32524#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:34,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {32524#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:34,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {32525#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:34,460 INFO L273 TraceCheckUtils]: 58: Hoare triple {32525#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32525#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:34,461 INFO L273 TraceCheckUtils]: 59: Hoare triple {32525#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:34,461 INFO L273 TraceCheckUtils]: 60: Hoare triple {32526#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:34,462 INFO L273 TraceCheckUtils]: 61: Hoare triple {32526#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32526#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:34,463 INFO L273 TraceCheckUtils]: 62: Hoare triple {32526#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:34,463 INFO L273 TraceCheckUtils]: 63: Hoare triple {32527#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:34,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {32527#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32527#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:34,464 INFO L273 TraceCheckUtils]: 65: Hoare triple {32527#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:34,465 INFO L273 TraceCheckUtils]: 66: Hoare triple {32528#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:34,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {32528#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32528#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:34,466 INFO L273 TraceCheckUtils]: 68: Hoare triple {32528#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:34,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {32529#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:34,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {32529#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32529#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:34,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {32529#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:34,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {32530#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:34,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {32530#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32530#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:34,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {32530#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:34,470 INFO L273 TraceCheckUtils]: 75: Hoare triple {32531#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:34,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {32531#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32531#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:34,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {32531#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:34,472 INFO L273 TraceCheckUtils]: 78: Hoare triple {32532#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:34,473 INFO L273 TraceCheckUtils]: 79: Hoare triple {32532#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32532#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:34,473 INFO L273 TraceCheckUtils]: 80: Hoare triple {32532#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:34,474 INFO L273 TraceCheckUtils]: 81: Hoare triple {32533#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:34,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {32533#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32533#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:34,475 INFO L273 TraceCheckUtils]: 83: Hoare triple {32533#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:34,476 INFO L273 TraceCheckUtils]: 84: Hoare triple {32534#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:34,479 INFO L273 TraceCheckUtils]: 85: Hoare triple {32534#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32534#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:34,480 INFO L273 TraceCheckUtils]: 86: Hoare triple {32534#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:34,480 INFO L273 TraceCheckUtils]: 87: Hoare triple {32535#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:34,481 INFO L273 TraceCheckUtils]: 88: Hoare triple {32535#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32535#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:34,481 INFO L273 TraceCheckUtils]: 89: Hoare triple {32535#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:34,482 INFO L273 TraceCheckUtils]: 90: Hoare triple {32536#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:34,482 INFO L273 TraceCheckUtils]: 91: Hoare triple {32536#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32536#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:34,482 INFO L273 TraceCheckUtils]: 92: Hoare triple {32536#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:34,483 INFO L273 TraceCheckUtils]: 93: Hoare triple {32537#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:34,483 INFO L273 TraceCheckUtils]: 94: Hoare triple {32537#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32537#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:34,484 INFO L273 TraceCheckUtils]: 95: Hoare triple {32537#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:34,484 INFO L273 TraceCheckUtils]: 96: Hoare triple {32538#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:34,485 INFO L273 TraceCheckUtils]: 97: Hoare triple {32538#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32538#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:34,485 INFO L273 TraceCheckUtils]: 98: Hoare triple {32538#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:34,486 INFO L273 TraceCheckUtils]: 99: Hoare triple {32539#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:34,486 INFO L273 TraceCheckUtils]: 100: Hoare triple {32539#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32539#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:34,487 INFO L273 TraceCheckUtils]: 101: Hoare triple {32539#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:34,488 INFO L273 TraceCheckUtils]: 102: Hoare triple {32540#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:34,488 INFO L273 TraceCheckUtils]: 103: Hoare triple {32540#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32540#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:34,489 INFO L273 TraceCheckUtils]: 104: Hoare triple {32540#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:34,490 INFO L273 TraceCheckUtils]: 105: Hoare triple {32541#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:34,490 INFO L273 TraceCheckUtils]: 106: Hoare triple {32541#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32541#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:34,491 INFO L273 TraceCheckUtils]: 107: Hoare triple {32541#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:34,491 INFO L273 TraceCheckUtils]: 108: Hoare triple {32542#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:34,492 INFO L273 TraceCheckUtils]: 109: Hoare triple {32542#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32542#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:34,493 INFO L273 TraceCheckUtils]: 110: Hoare triple {32542#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:34,493 INFO L273 TraceCheckUtils]: 111: Hoare triple {32543#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:34,494 INFO L273 TraceCheckUtils]: 112: Hoare triple {32543#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32543#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:34,495 INFO L273 TraceCheckUtils]: 113: Hoare triple {32543#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:34,495 INFO L273 TraceCheckUtils]: 114: Hoare triple {32544#(<= main_~i~0 36)} assume !(~i~0 < 100000); {32507#false} is VALID [2018-11-23 12:00:34,495 INFO L273 TraceCheckUtils]: 115: Hoare triple {32507#false} havoc ~x~0; {32507#false} is VALID [2018-11-23 12:00:34,496 INFO L273 TraceCheckUtils]: 116: Hoare triple {32507#false} assume 0 != ~rv~0;~x~0 := 0; {32507#false} is VALID [2018-11-23 12:00:34,496 INFO L273 TraceCheckUtils]: 117: Hoare triple {32507#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {32507#false} is VALID [2018-11-23 12:00:34,496 INFO L256 TraceCheckUtils]: 118: Hoare triple {32507#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {32507#false} is VALID [2018-11-23 12:00:34,496 INFO L273 TraceCheckUtils]: 119: Hoare triple {32507#false} ~cond := #in~cond; {32507#false} is VALID [2018-11-23 12:00:34,496 INFO L273 TraceCheckUtils]: 120: Hoare triple {32507#false} assume 0 == ~cond; {32507#false} is VALID [2018-11-23 12:00:34,496 INFO L273 TraceCheckUtils]: 121: Hoare triple {32507#false} assume !false; {32507#false} is VALID [2018-11-23 12:00:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:34,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:34,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:01:10,113 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 12:01:10,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:10,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:10,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {32506#true} call ULTIMATE.init(); {32506#true} is VALID [2018-11-23 12:01:10,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {32506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32506#true} is VALID [2018-11-23 12:01:10,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {32506#true} assume true; {32506#true} is VALID [2018-11-23 12:01:10,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32506#true} {32506#true} #77#return; {32506#true} is VALID [2018-11-23 12:01:10,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {32506#true} call #t~ret9 := main(); {32506#true} is VALID [2018-11-23 12:01:10,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {32506#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {32563#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:10,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {32563#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32563#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:10,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {32563#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32563#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:10,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {32563#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:10,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {32509#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:10,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {32509#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32509#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:10,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {32509#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:10,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {32510#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:10,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {32510#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32510#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:10,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {32510#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:10,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {32511#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:10,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {32511#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32511#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:10,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {32511#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:10,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {32512#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:10,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {32512#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32512#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:10,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {32512#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:10,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {32513#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:10,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {32513#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32513#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:10,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {32513#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:10,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {32514#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:10,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {32514#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32514#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:10,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {32514#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:10,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {32515#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:10,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {32515#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32515#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:10,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {32515#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:10,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {32516#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:10,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {32516#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32516#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:10,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {32516#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:10,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {32517#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:10,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {32517#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32517#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:10,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {32517#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:10,991 INFO L273 TraceCheckUtils]: 36: Hoare triple {32518#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:10,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {32518#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32518#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:10,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {32518#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:10,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {32519#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:10,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {32519#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32519#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:10,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {32519#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:10,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {32520#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:10,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {32520#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32520#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:10,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {32520#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:10,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {32521#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:10,998 INFO L273 TraceCheckUtils]: 46: Hoare triple {32521#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32521#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:10,998 INFO L273 TraceCheckUtils]: 47: Hoare triple {32521#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:10,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {32522#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:11,000 INFO L273 TraceCheckUtils]: 49: Hoare triple {32522#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32522#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:11,000 INFO L273 TraceCheckUtils]: 50: Hoare triple {32522#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:11,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {32523#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:11,001 INFO L273 TraceCheckUtils]: 52: Hoare triple {32523#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32523#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:11,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {32523#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:11,003 INFO L273 TraceCheckUtils]: 54: Hoare triple {32524#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:11,003 INFO L273 TraceCheckUtils]: 55: Hoare triple {32524#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32524#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:11,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {32524#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:11,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {32525#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:11,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {32525#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32525#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:11,006 INFO L273 TraceCheckUtils]: 59: Hoare triple {32525#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:11,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {32526#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:11,007 INFO L273 TraceCheckUtils]: 61: Hoare triple {32526#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32526#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:11,008 INFO L273 TraceCheckUtils]: 62: Hoare triple {32526#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:11,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {32527#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:11,009 INFO L273 TraceCheckUtils]: 64: Hoare triple {32527#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32527#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:11,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {32527#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:11,011 INFO L273 TraceCheckUtils]: 66: Hoare triple {32528#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:11,011 INFO L273 TraceCheckUtils]: 67: Hoare triple {32528#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32528#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:11,012 INFO L273 TraceCheckUtils]: 68: Hoare triple {32528#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:11,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {32529#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:11,013 INFO L273 TraceCheckUtils]: 70: Hoare triple {32529#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32529#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:11,014 INFO L273 TraceCheckUtils]: 71: Hoare triple {32529#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:11,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {32530#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:11,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {32530#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32530#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:11,020 INFO L273 TraceCheckUtils]: 74: Hoare triple {32530#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:11,022 INFO L273 TraceCheckUtils]: 75: Hoare triple {32531#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:11,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {32531#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32531#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:11,025 INFO L273 TraceCheckUtils]: 77: Hoare triple {32531#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:11,025 INFO L273 TraceCheckUtils]: 78: Hoare triple {32532#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:11,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {32532#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32532#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:11,028 INFO L273 TraceCheckUtils]: 80: Hoare triple {32532#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:11,030 INFO L273 TraceCheckUtils]: 81: Hoare triple {32533#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:11,030 INFO L273 TraceCheckUtils]: 82: Hoare triple {32533#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32533#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:11,033 INFO L273 TraceCheckUtils]: 83: Hoare triple {32533#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:11,033 INFO L273 TraceCheckUtils]: 84: Hoare triple {32534#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:11,036 INFO L273 TraceCheckUtils]: 85: Hoare triple {32534#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32534#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:11,036 INFO L273 TraceCheckUtils]: 86: Hoare triple {32534#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:11,039 INFO L273 TraceCheckUtils]: 87: Hoare triple {32535#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:11,039 INFO L273 TraceCheckUtils]: 88: Hoare triple {32535#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32535#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:11,042 INFO L273 TraceCheckUtils]: 89: Hoare triple {32535#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:11,042 INFO L273 TraceCheckUtils]: 90: Hoare triple {32536#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:11,045 INFO L273 TraceCheckUtils]: 91: Hoare triple {32536#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32536#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:11,045 INFO L273 TraceCheckUtils]: 92: Hoare triple {32536#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:11,048 INFO L273 TraceCheckUtils]: 93: Hoare triple {32537#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:11,048 INFO L273 TraceCheckUtils]: 94: Hoare triple {32537#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32537#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:11,050 INFO L273 TraceCheckUtils]: 95: Hoare triple {32537#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:11,050 INFO L273 TraceCheckUtils]: 96: Hoare triple {32538#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:11,053 INFO L273 TraceCheckUtils]: 97: Hoare triple {32538#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32538#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:11,053 INFO L273 TraceCheckUtils]: 98: Hoare triple {32538#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:11,056 INFO L273 TraceCheckUtils]: 99: Hoare triple {32539#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:11,056 INFO L273 TraceCheckUtils]: 100: Hoare triple {32539#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32539#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:11,059 INFO L273 TraceCheckUtils]: 101: Hoare triple {32539#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:11,059 INFO L273 TraceCheckUtils]: 102: Hoare triple {32540#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:11,062 INFO L273 TraceCheckUtils]: 103: Hoare triple {32540#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32540#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:11,062 INFO L273 TraceCheckUtils]: 104: Hoare triple {32540#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:11,065 INFO L273 TraceCheckUtils]: 105: Hoare triple {32541#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:11,065 INFO L273 TraceCheckUtils]: 106: Hoare triple {32541#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32541#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:11,068 INFO L273 TraceCheckUtils]: 107: Hoare triple {32541#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:11,068 INFO L273 TraceCheckUtils]: 108: Hoare triple {32542#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:11,070 INFO L273 TraceCheckUtils]: 109: Hoare triple {32542#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32542#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:11,073 INFO L273 TraceCheckUtils]: 110: Hoare triple {32542#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:11,073 INFO L273 TraceCheckUtils]: 111: Hoare triple {32543#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:11,075 INFO L273 TraceCheckUtils]: 112: Hoare triple {32543#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {32543#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:11,075 INFO L273 TraceCheckUtils]: 113: Hoare triple {32543#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 114: Hoare triple {32544#(<= main_~i~0 36)} assume !(~i~0 < 100000); {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 115: Hoare triple {32507#false} havoc ~x~0; {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 116: Hoare triple {32507#false} assume 0 != ~rv~0;~x~0 := 0; {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 117: Hoare triple {32507#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L256 TraceCheckUtils]: 118: Hoare triple {32507#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 119: Hoare triple {32507#false} ~cond := #in~cond; {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 120: Hoare triple {32507#false} assume 0 == ~cond; {32507#false} is VALID [2018-11-23 12:01:11,078 INFO L273 TraceCheckUtils]: 121: Hoare triple {32507#false} assume !false; {32507#false} is VALID [2018-11-23 12:01:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:11,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:01:11,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2018-11-23 12:01:11,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:11,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:01:11,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:11,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:01:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:01:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:01:11,258 INFO L87 Difference]: Start difference. First operand 241 states and 317 transitions. Second operand 40 states. [2018-11-23 12:01:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:12,230 INFO L93 Difference]: Finished difference Result 270 states and 355 transitions. [2018-11-23 12:01:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:01:12,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2018-11-23 12:01:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:01:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 200 transitions. [2018-11-23 12:01:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:01:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 200 transitions. [2018-11-23 12:01:12,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 200 transitions. [2018-11-23 12:01:12,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:12,423 INFO L225 Difference]: With dead ends: 270 [2018-11-23 12:01:12,424 INFO L226 Difference]: Without dead ends: 251 [2018-11-23 12:01:12,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:01:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-23 12:01:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-11-23 12:01:12,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:12,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand 247 states. [2018-11-23 12:01:12,508 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 247 states. [2018-11-23 12:01:12,508 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 247 states. [2018-11-23 12:01:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:12,513 INFO L93 Difference]: Finished difference Result 251 states and 331 transitions. [2018-11-23 12:01:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2018-11-23 12:01:12,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:12,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:12,513 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 251 states. [2018-11-23 12:01:12,513 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 251 states. [2018-11-23 12:01:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:12,518 INFO L93 Difference]: Finished difference Result 251 states and 331 transitions. [2018-11-23 12:01:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2018-11-23 12:01:12,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:12,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:12,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:12,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-23 12:01:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 325 transitions. [2018-11-23 12:01:12,522 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 325 transitions. Word has length 122 [2018-11-23 12:01:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:12,522 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 325 transitions. [2018-11-23 12:01:12,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:01:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 325 transitions. [2018-11-23 12:01:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 12:01:12,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:12,523 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:12,523 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:12,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1013439456, now seen corresponding path program 37 times [2018-11-23 12:01:12,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:12,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:12,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:13,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {34103#true} call ULTIMATE.init(); {34103#true} is VALID [2018-11-23 12:01:13,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {34103#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34103#true} is VALID [2018-11-23 12:01:13,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {34103#true} assume true; {34103#true} is VALID [2018-11-23 12:01:13,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34103#true} {34103#true} #77#return; {34103#true} is VALID [2018-11-23 12:01:13,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {34103#true} call #t~ret9 := main(); {34103#true} is VALID [2018-11-23 12:01:13,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {34103#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {34105#(= main_~i~0 0)} is VALID [2018-11-23 12:01:13,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {34105#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34105#(= main_~i~0 0)} is VALID [2018-11-23 12:01:13,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {34105#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34105#(= main_~i~0 0)} is VALID [2018-11-23 12:01:13,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {34105#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34106#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:13,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {34106#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34106#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:13,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {34106#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34106#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:13,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {34106#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34107#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:13,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {34107#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34107#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:13,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {34107#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34107#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:13,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {34107#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34108#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:13,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {34108#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34108#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:13,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {34108#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34108#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:13,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {34108#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34109#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:13,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {34109#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34109#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:13,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {34109#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34109#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:13,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {34109#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34110#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:13,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {34110#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34110#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:13,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {34110#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34110#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:13,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {34110#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34111#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:13,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {34111#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34111#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:13,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {34111#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34111#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:13,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {34111#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34112#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:13,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {34112#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34112#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:13,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {34112#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34112#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:13,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {34112#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34113#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:13,513 INFO L273 TraceCheckUtils]: 30: Hoare triple {34113#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34113#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:13,513 INFO L273 TraceCheckUtils]: 31: Hoare triple {34113#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34113#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:13,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {34113#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34114#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:13,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {34114#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34114#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:13,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {34114#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34114#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:13,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {34114#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34115#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:13,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {34115#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34115#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:13,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {34115#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34115#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:13,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {34115#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34116#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:13,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {34116#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34116#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:13,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {34116#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34116#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:13,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {34116#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34117#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:13,520 INFO L273 TraceCheckUtils]: 42: Hoare triple {34117#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34117#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:13,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {34117#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34117#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:13,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {34117#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34118#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:13,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {34118#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34118#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:13,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {34118#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34118#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:13,523 INFO L273 TraceCheckUtils]: 47: Hoare triple {34118#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34119#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:13,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {34119#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34119#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:13,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {34119#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34119#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:13,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {34119#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34120#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:13,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {34120#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34120#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:13,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {34120#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34120#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:13,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {34120#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34121#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:13,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {34121#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34121#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:13,528 INFO L273 TraceCheckUtils]: 55: Hoare triple {34121#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34121#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:13,529 INFO L273 TraceCheckUtils]: 56: Hoare triple {34121#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34122#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:13,529 INFO L273 TraceCheckUtils]: 57: Hoare triple {34122#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34122#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:13,530 INFO L273 TraceCheckUtils]: 58: Hoare triple {34122#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34122#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:13,531 INFO L273 TraceCheckUtils]: 59: Hoare triple {34122#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34123#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:13,531 INFO L273 TraceCheckUtils]: 60: Hoare triple {34123#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34123#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:13,532 INFO L273 TraceCheckUtils]: 61: Hoare triple {34123#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34123#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:13,532 INFO L273 TraceCheckUtils]: 62: Hoare triple {34123#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34124#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:13,533 INFO L273 TraceCheckUtils]: 63: Hoare triple {34124#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34124#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:13,533 INFO L273 TraceCheckUtils]: 64: Hoare triple {34124#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34124#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:13,534 INFO L273 TraceCheckUtils]: 65: Hoare triple {34124#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34125#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:13,535 INFO L273 TraceCheckUtils]: 66: Hoare triple {34125#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34125#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:13,535 INFO L273 TraceCheckUtils]: 67: Hoare triple {34125#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34125#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:13,536 INFO L273 TraceCheckUtils]: 68: Hoare triple {34125#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34126#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:13,537 INFO L273 TraceCheckUtils]: 69: Hoare triple {34126#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34126#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:13,537 INFO L273 TraceCheckUtils]: 70: Hoare triple {34126#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34126#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:13,538 INFO L273 TraceCheckUtils]: 71: Hoare triple {34126#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34127#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:13,538 INFO L273 TraceCheckUtils]: 72: Hoare triple {34127#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34127#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:13,539 INFO L273 TraceCheckUtils]: 73: Hoare triple {34127#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34127#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:13,540 INFO L273 TraceCheckUtils]: 74: Hoare triple {34127#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34128#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:13,540 INFO L273 TraceCheckUtils]: 75: Hoare triple {34128#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34128#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:13,541 INFO L273 TraceCheckUtils]: 76: Hoare triple {34128#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34128#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:13,542 INFO L273 TraceCheckUtils]: 77: Hoare triple {34128#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34129#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:13,542 INFO L273 TraceCheckUtils]: 78: Hoare triple {34129#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34129#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:13,543 INFO L273 TraceCheckUtils]: 79: Hoare triple {34129#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34129#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:13,543 INFO L273 TraceCheckUtils]: 80: Hoare triple {34129#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34130#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:13,544 INFO L273 TraceCheckUtils]: 81: Hoare triple {34130#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34130#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:13,544 INFO L273 TraceCheckUtils]: 82: Hoare triple {34130#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34130#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:13,545 INFO L273 TraceCheckUtils]: 83: Hoare triple {34130#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34131#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:13,546 INFO L273 TraceCheckUtils]: 84: Hoare triple {34131#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34131#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:13,546 INFO L273 TraceCheckUtils]: 85: Hoare triple {34131#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34131#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:13,547 INFO L273 TraceCheckUtils]: 86: Hoare triple {34131#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34132#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:13,548 INFO L273 TraceCheckUtils]: 87: Hoare triple {34132#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34132#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:13,548 INFO L273 TraceCheckUtils]: 88: Hoare triple {34132#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34132#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:13,549 INFO L273 TraceCheckUtils]: 89: Hoare triple {34132#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34133#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:13,549 INFO L273 TraceCheckUtils]: 90: Hoare triple {34133#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34133#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:13,550 INFO L273 TraceCheckUtils]: 91: Hoare triple {34133#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34133#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:13,551 INFO L273 TraceCheckUtils]: 92: Hoare triple {34133#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34134#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:13,551 INFO L273 TraceCheckUtils]: 93: Hoare triple {34134#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34134#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:13,552 INFO L273 TraceCheckUtils]: 94: Hoare triple {34134#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34134#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:13,552 INFO L273 TraceCheckUtils]: 95: Hoare triple {34134#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34135#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:13,553 INFO L273 TraceCheckUtils]: 96: Hoare triple {34135#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34135#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:13,553 INFO L273 TraceCheckUtils]: 97: Hoare triple {34135#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34135#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:13,554 INFO L273 TraceCheckUtils]: 98: Hoare triple {34135#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34136#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:13,555 INFO L273 TraceCheckUtils]: 99: Hoare triple {34136#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34136#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:13,555 INFO L273 TraceCheckUtils]: 100: Hoare triple {34136#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34136#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:13,556 INFO L273 TraceCheckUtils]: 101: Hoare triple {34136#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34137#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:13,557 INFO L273 TraceCheckUtils]: 102: Hoare triple {34137#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34137#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:13,557 INFO L273 TraceCheckUtils]: 103: Hoare triple {34137#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34137#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:13,558 INFO L273 TraceCheckUtils]: 104: Hoare triple {34137#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34138#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:13,558 INFO L273 TraceCheckUtils]: 105: Hoare triple {34138#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34138#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:13,559 INFO L273 TraceCheckUtils]: 106: Hoare triple {34138#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34138#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:13,560 INFO L273 TraceCheckUtils]: 107: Hoare triple {34138#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34139#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:13,560 INFO L273 TraceCheckUtils]: 108: Hoare triple {34139#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34139#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:13,561 INFO L273 TraceCheckUtils]: 109: Hoare triple {34139#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34139#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:13,562 INFO L273 TraceCheckUtils]: 110: Hoare triple {34139#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34140#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:13,562 INFO L273 TraceCheckUtils]: 111: Hoare triple {34140#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34140#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:13,563 INFO L273 TraceCheckUtils]: 112: Hoare triple {34140#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34140#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:13,563 INFO L273 TraceCheckUtils]: 113: Hoare triple {34140#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34141#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:13,564 INFO L273 TraceCheckUtils]: 114: Hoare triple {34141#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34141#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:13,564 INFO L273 TraceCheckUtils]: 115: Hoare triple {34141#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34141#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:13,565 INFO L273 TraceCheckUtils]: 116: Hoare triple {34141#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34142#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:13,566 INFO L273 TraceCheckUtils]: 117: Hoare triple {34142#(<= main_~i~0 37)} assume !(~i~0 < 100000); {34104#false} is VALID [2018-11-23 12:01:13,566 INFO L273 TraceCheckUtils]: 118: Hoare triple {34104#false} havoc ~x~0; {34104#false} is VALID [2018-11-23 12:01:13,566 INFO L273 TraceCheckUtils]: 119: Hoare triple {34104#false} assume 0 != ~rv~0;~x~0 := 0; {34104#false} is VALID [2018-11-23 12:01:13,566 INFO L273 TraceCheckUtils]: 120: Hoare triple {34104#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {34104#false} is VALID [2018-11-23 12:01:13,567 INFO L256 TraceCheckUtils]: 121: Hoare triple {34104#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {34104#false} is VALID [2018-11-23 12:01:13,567 INFO L273 TraceCheckUtils]: 122: Hoare triple {34104#false} ~cond := #in~cond; {34104#false} is VALID [2018-11-23 12:01:13,567 INFO L273 TraceCheckUtils]: 123: Hoare triple {34104#false} assume 0 == ~cond; {34104#false} is VALID [2018-11-23 12:01:13,567 INFO L273 TraceCheckUtils]: 124: Hoare triple {34104#false} assume !false; {34104#false} is VALID [2018-11-23 12:01:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:13,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:13,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:13,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:13,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:13,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {34103#true} call ULTIMATE.init(); {34103#true} is VALID [2018-11-23 12:01:13,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {34103#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34103#true} is VALID [2018-11-23 12:01:13,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {34103#true} assume true; {34103#true} is VALID [2018-11-23 12:01:13,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34103#true} {34103#true} #77#return; {34103#true} is VALID [2018-11-23 12:01:13,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {34103#true} call #t~ret9 := main(); {34103#true} is VALID [2018-11-23 12:01:13,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {34103#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {34161#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:13,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {34161#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34161#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:13,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {34161#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34161#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:13,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {34161#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34106#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:13,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {34106#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34106#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:13,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {34106#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34106#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:13,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {34106#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34107#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:13,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {34107#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34107#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:13,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {34107#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34107#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:13,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {34107#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34108#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:13,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {34108#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34108#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:13,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {34108#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34108#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:13,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {34108#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34109#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:13,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {34109#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34109#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:13,992 INFO L273 TraceCheckUtils]: 19: Hoare triple {34109#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34109#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:13,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {34109#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34110#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:13,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {34110#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34110#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:13,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {34110#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34110#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:13,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {34110#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34111#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:13,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {34111#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34111#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:13,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {34111#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34111#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:13,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {34111#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34112#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:13,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {34112#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34112#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:13,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {34112#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34112#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:13,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {34112#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34113#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:13,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {34113#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34113#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:13,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {34113#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34113#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:14,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {34113#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34114#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:14,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {34114#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34114#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:14,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {34114#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34114#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:14,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {34114#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34115#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:14,002 INFO L273 TraceCheckUtils]: 36: Hoare triple {34115#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34115#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:14,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {34115#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34115#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:14,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {34115#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34116#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:14,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {34116#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34116#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:14,005 INFO L273 TraceCheckUtils]: 40: Hoare triple {34116#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34116#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:14,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {34116#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34117#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:14,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {34117#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34117#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:14,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {34117#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34117#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:14,007 INFO L273 TraceCheckUtils]: 44: Hoare triple {34117#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34118#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:14,008 INFO L273 TraceCheckUtils]: 45: Hoare triple {34118#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34118#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:14,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {34118#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34118#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:14,009 INFO L273 TraceCheckUtils]: 47: Hoare triple {34118#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34119#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:14,010 INFO L273 TraceCheckUtils]: 48: Hoare triple {34119#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34119#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:14,010 INFO L273 TraceCheckUtils]: 49: Hoare triple {34119#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34119#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:14,011 INFO L273 TraceCheckUtils]: 50: Hoare triple {34119#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34120#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:14,011 INFO L273 TraceCheckUtils]: 51: Hoare triple {34120#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34120#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:14,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {34120#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34120#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:14,013 INFO L273 TraceCheckUtils]: 53: Hoare triple {34120#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34121#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:14,013 INFO L273 TraceCheckUtils]: 54: Hoare triple {34121#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34121#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:14,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {34121#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34121#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:14,015 INFO L273 TraceCheckUtils]: 56: Hoare triple {34121#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34122#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:14,015 INFO L273 TraceCheckUtils]: 57: Hoare triple {34122#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34122#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:14,016 INFO L273 TraceCheckUtils]: 58: Hoare triple {34122#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34122#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:14,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {34122#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34123#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:14,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {34123#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34123#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:14,017 INFO L273 TraceCheckUtils]: 61: Hoare triple {34123#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34123#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:14,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {34123#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34124#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:14,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {34124#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34124#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:14,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {34124#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34124#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:14,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {34124#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34125#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:14,021 INFO L273 TraceCheckUtils]: 66: Hoare triple {34125#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34125#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:14,021 INFO L273 TraceCheckUtils]: 67: Hoare triple {34125#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34125#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:14,022 INFO L273 TraceCheckUtils]: 68: Hoare triple {34125#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34126#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:14,023 INFO L273 TraceCheckUtils]: 69: Hoare triple {34126#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34126#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:14,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {34126#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34126#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:14,024 INFO L273 TraceCheckUtils]: 71: Hoare triple {34126#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34127#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:14,025 INFO L273 TraceCheckUtils]: 72: Hoare triple {34127#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34127#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:14,025 INFO L273 TraceCheckUtils]: 73: Hoare triple {34127#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34127#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:14,026 INFO L273 TraceCheckUtils]: 74: Hoare triple {34127#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34128#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:14,027 INFO L273 TraceCheckUtils]: 75: Hoare triple {34128#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34128#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:14,027 INFO L273 TraceCheckUtils]: 76: Hoare triple {34128#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34128#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:14,028 INFO L273 TraceCheckUtils]: 77: Hoare triple {34128#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34129#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:14,028 INFO L273 TraceCheckUtils]: 78: Hoare triple {34129#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34129#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:14,029 INFO L273 TraceCheckUtils]: 79: Hoare triple {34129#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34129#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:14,030 INFO L273 TraceCheckUtils]: 80: Hoare triple {34129#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34130#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:14,030 INFO L273 TraceCheckUtils]: 81: Hoare triple {34130#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34130#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:14,031 INFO L273 TraceCheckUtils]: 82: Hoare triple {34130#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34130#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:14,031 INFO L273 TraceCheckUtils]: 83: Hoare triple {34130#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34131#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:14,032 INFO L273 TraceCheckUtils]: 84: Hoare triple {34131#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34131#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:14,032 INFO L273 TraceCheckUtils]: 85: Hoare triple {34131#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34131#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:14,033 INFO L273 TraceCheckUtils]: 86: Hoare triple {34131#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34132#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:14,034 INFO L273 TraceCheckUtils]: 87: Hoare triple {34132#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34132#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:14,034 INFO L273 TraceCheckUtils]: 88: Hoare triple {34132#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34132#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:14,035 INFO L273 TraceCheckUtils]: 89: Hoare triple {34132#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34133#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:14,036 INFO L273 TraceCheckUtils]: 90: Hoare triple {34133#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34133#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:14,036 INFO L273 TraceCheckUtils]: 91: Hoare triple {34133#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34133#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:14,037 INFO L273 TraceCheckUtils]: 92: Hoare triple {34133#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34134#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:14,038 INFO L273 TraceCheckUtils]: 93: Hoare triple {34134#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34134#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:14,038 INFO L273 TraceCheckUtils]: 94: Hoare triple {34134#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34134#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:14,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {34134#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34135#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:14,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {34135#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34135#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:14,040 INFO L273 TraceCheckUtils]: 97: Hoare triple {34135#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34135#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:14,041 INFO L273 TraceCheckUtils]: 98: Hoare triple {34135#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34136#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:14,041 INFO L273 TraceCheckUtils]: 99: Hoare triple {34136#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34136#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:14,042 INFO L273 TraceCheckUtils]: 100: Hoare triple {34136#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34136#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:14,043 INFO L273 TraceCheckUtils]: 101: Hoare triple {34136#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34137#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:14,043 INFO L273 TraceCheckUtils]: 102: Hoare triple {34137#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34137#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:14,044 INFO L273 TraceCheckUtils]: 103: Hoare triple {34137#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34137#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:14,045 INFO L273 TraceCheckUtils]: 104: Hoare triple {34137#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34138#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:14,045 INFO L273 TraceCheckUtils]: 105: Hoare triple {34138#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34138#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:14,046 INFO L273 TraceCheckUtils]: 106: Hoare triple {34138#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34138#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:14,047 INFO L273 TraceCheckUtils]: 107: Hoare triple {34138#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34139#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:14,047 INFO L273 TraceCheckUtils]: 108: Hoare triple {34139#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34139#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:14,047 INFO L273 TraceCheckUtils]: 109: Hoare triple {34139#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34139#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:14,048 INFO L273 TraceCheckUtils]: 110: Hoare triple {34139#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34140#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:14,049 INFO L273 TraceCheckUtils]: 111: Hoare triple {34140#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34140#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:14,049 INFO L273 TraceCheckUtils]: 112: Hoare triple {34140#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34140#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:14,050 INFO L273 TraceCheckUtils]: 113: Hoare triple {34140#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34141#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:14,051 INFO L273 TraceCheckUtils]: 114: Hoare triple {34141#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {34141#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:14,051 INFO L273 TraceCheckUtils]: 115: Hoare triple {34141#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {34141#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:14,052 INFO L273 TraceCheckUtils]: 116: Hoare triple {34141#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {34142#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:14,053 INFO L273 TraceCheckUtils]: 117: Hoare triple {34142#(<= main_~i~0 37)} assume !(~i~0 < 100000); {34104#false} is VALID [2018-11-23 12:01:14,053 INFO L273 TraceCheckUtils]: 118: Hoare triple {34104#false} havoc ~x~0; {34104#false} is VALID [2018-11-23 12:01:14,053 INFO L273 TraceCheckUtils]: 119: Hoare triple {34104#false} assume 0 != ~rv~0;~x~0 := 0; {34104#false} is VALID [2018-11-23 12:01:14,053 INFO L273 TraceCheckUtils]: 120: Hoare triple {34104#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {34104#false} is VALID [2018-11-23 12:01:14,053 INFO L256 TraceCheckUtils]: 121: Hoare triple {34104#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {34104#false} is VALID [2018-11-23 12:01:14,054 INFO L273 TraceCheckUtils]: 122: Hoare triple {34104#false} ~cond := #in~cond; {34104#false} is VALID [2018-11-23 12:01:14,054 INFO L273 TraceCheckUtils]: 123: Hoare triple {34104#false} assume 0 == ~cond; {34104#false} is VALID [2018-11-23 12:01:14,054 INFO L273 TraceCheckUtils]: 124: Hoare triple {34104#false} assume !false; {34104#false} is VALID [2018-11-23 12:01:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:14,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:14,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:01:14,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2018-11-23 12:01:14,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:14,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:01:14,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:14,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:01:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:01:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:01:14,206 INFO L87 Difference]: Start difference. First operand 247 states and 325 transitions. Second operand 41 states. [2018-11-23 12:01:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,113 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2018-11-23 12:01:15,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:01:15,113 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2018-11-23 12:01:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:01:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 204 transitions. [2018-11-23 12:01:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:01:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 204 transitions. [2018-11-23 12:01:15,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 204 transitions. [2018-11-23 12:01:15,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:15,310 INFO L225 Difference]: With dead ends: 276 [2018-11-23 12:01:15,311 INFO L226 Difference]: Without dead ends: 257 [2018-11-23 12:01:15,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:01:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-23 12:01:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2018-11-23 12:01:15,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:15,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 253 states. [2018-11-23 12:01:15,891 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 253 states. [2018-11-23 12:01:15,892 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 253 states. [2018-11-23 12:01:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,899 INFO L93 Difference]: Finished difference Result 257 states and 339 transitions. [2018-11-23 12:01:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2018-11-23 12:01:15,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:15,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:15,899 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 257 states. [2018-11-23 12:01:15,899 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 257 states. [2018-11-23 12:01:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,905 INFO L93 Difference]: Finished difference Result 257 states and 339 transitions. [2018-11-23 12:01:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2018-11-23 12:01:15,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:15,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:15,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:15,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-23 12:01:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 333 transitions. [2018-11-23 12:01:15,911 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 333 transitions. Word has length 125 [2018-11-23 12:01:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:15,911 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 333 transitions. [2018-11-23 12:01:15,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:01:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 333 transitions. [2018-11-23 12:01:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:01:15,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:15,912 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:15,912 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:15,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1936591136, now seen corresponding path program 38 times [2018-11-23 12:01:15,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:15,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:15,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:16,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {35738#true} call ULTIMATE.init(); {35738#true} is VALID [2018-11-23 12:01:16,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {35738#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35738#true} is VALID [2018-11-23 12:01:16,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {35738#true} assume true; {35738#true} is VALID [2018-11-23 12:01:16,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35738#true} {35738#true} #77#return; {35738#true} is VALID [2018-11-23 12:01:16,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {35738#true} call #t~ret9 := main(); {35738#true} is VALID [2018-11-23 12:01:16,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {35738#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {35740#(= main_~i~0 0)} is VALID [2018-11-23 12:01:16,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {35740#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35740#(= main_~i~0 0)} is VALID [2018-11-23 12:01:16,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {35740#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35740#(= main_~i~0 0)} is VALID [2018-11-23 12:01:16,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {35740#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35741#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:16,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {35741#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35741#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:16,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {35741#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35741#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:16,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {35741#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35742#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:16,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {35742#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35742#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:16,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {35742#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35742#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:16,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {35742#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35743#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:16,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {35743#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35743#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:16,900 INFO L273 TraceCheckUtils]: 16: Hoare triple {35743#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35743#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:16,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {35743#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35744#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:16,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {35744#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35744#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:16,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {35744#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35744#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:16,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {35744#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35745#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:16,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {35745#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35745#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:16,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {35745#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35745#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:16,905 INFO L273 TraceCheckUtils]: 23: Hoare triple {35745#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35746#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:16,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {35746#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35746#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:16,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {35746#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35746#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:16,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {35746#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35747#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:16,907 INFO L273 TraceCheckUtils]: 27: Hoare triple {35747#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35747#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:16,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {35747#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35747#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:16,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {35747#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35748#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:16,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {35748#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35748#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:16,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {35748#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35748#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:16,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {35748#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35749#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:16,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {35749#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35749#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:16,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {35749#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35749#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:16,912 INFO L273 TraceCheckUtils]: 35: Hoare triple {35749#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35750#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:16,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {35750#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35750#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:16,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {35750#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35750#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:16,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {35750#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35751#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:16,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {35751#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35751#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:16,915 INFO L273 TraceCheckUtils]: 40: Hoare triple {35751#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35751#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:16,915 INFO L273 TraceCheckUtils]: 41: Hoare triple {35751#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35752#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:16,918 INFO L273 TraceCheckUtils]: 42: Hoare triple {35752#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35752#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:16,918 INFO L273 TraceCheckUtils]: 43: Hoare triple {35752#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35752#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:16,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {35752#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35753#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:16,919 INFO L273 TraceCheckUtils]: 45: Hoare triple {35753#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35753#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:16,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {35753#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35753#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:16,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {35753#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35754#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:16,920 INFO L273 TraceCheckUtils]: 48: Hoare triple {35754#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35754#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:16,921 INFO L273 TraceCheckUtils]: 49: Hoare triple {35754#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35754#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:16,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {35754#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35755#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:16,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {35755#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35755#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:16,922 INFO L273 TraceCheckUtils]: 52: Hoare triple {35755#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35755#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:16,923 INFO L273 TraceCheckUtils]: 53: Hoare triple {35755#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35756#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:16,923 INFO L273 TraceCheckUtils]: 54: Hoare triple {35756#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35756#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:16,924 INFO L273 TraceCheckUtils]: 55: Hoare triple {35756#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35756#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:16,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {35756#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35757#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:16,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {35757#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35757#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:16,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {35757#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35757#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:16,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {35757#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35758#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:16,927 INFO L273 TraceCheckUtils]: 60: Hoare triple {35758#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35758#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:16,927 INFO L273 TraceCheckUtils]: 61: Hoare triple {35758#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35758#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:16,928 INFO L273 TraceCheckUtils]: 62: Hoare triple {35758#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35759#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:16,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {35759#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35759#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:16,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {35759#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35759#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:16,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {35759#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35760#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:16,930 INFO L273 TraceCheckUtils]: 66: Hoare triple {35760#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35760#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:16,931 INFO L273 TraceCheckUtils]: 67: Hoare triple {35760#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35760#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:16,932 INFO L273 TraceCheckUtils]: 68: Hoare triple {35760#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35761#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:16,932 INFO L273 TraceCheckUtils]: 69: Hoare triple {35761#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35761#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:16,933 INFO L273 TraceCheckUtils]: 70: Hoare triple {35761#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35761#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:16,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {35761#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35762#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:16,934 INFO L273 TraceCheckUtils]: 72: Hoare triple {35762#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35762#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:16,935 INFO L273 TraceCheckUtils]: 73: Hoare triple {35762#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35762#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:16,935 INFO L273 TraceCheckUtils]: 74: Hoare triple {35762#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35763#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:16,936 INFO L273 TraceCheckUtils]: 75: Hoare triple {35763#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35763#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:16,958 INFO L273 TraceCheckUtils]: 76: Hoare triple {35763#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35763#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:16,974 INFO L273 TraceCheckUtils]: 77: Hoare triple {35763#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35764#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:16,982 INFO L273 TraceCheckUtils]: 78: Hoare triple {35764#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35764#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:16,983 INFO L273 TraceCheckUtils]: 79: Hoare triple {35764#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35764#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:16,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {35764#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35765#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:16,984 INFO L273 TraceCheckUtils]: 81: Hoare triple {35765#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35765#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:16,984 INFO L273 TraceCheckUtils]: 82: Hoare triple {35765#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35765#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:16,985 INFO L273 TraceCheckUtils]: 83: Hoare triple {35765#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35766#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:16,985 INFO L273 TraceCheckUtils]: 84: Hoare triple {35766#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35766#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:16,985 INFO L273 TraceCheckUtils]: 85: Hoare triple {35766#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35766#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:16,986 INFO L273 TraceCheckUtils]: 86: Hoare triple {35766#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35767#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:16,986 INFO L273 TraceCheckUtils]: 87: Hoare triple {35767#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35767#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:16,986 INFO L273 TraceCheckUtils]: 88: Hoare triple {35767#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35767#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:16,987 INFO L273 TraceCheckUtils]: 89: Hoare triple {35767#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35768#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:16,988 INFO L273 TraceCheckUtils]: 90: Hoare triple {35768#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35768#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:16,988 INFO L273 TraceCheckUtils]: 91: Hoare triple {35768#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35768#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:16,989 INFO L273 TraceCheckUtils]: 92: Hoare triple {35768#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35769#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:16,990 INFO L273 TraceCheckUtils]: 93: Hoare triple {35769#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35769#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:16,990 INFO L273 TraceCheckUtils]: 94: Hoare triple {35769#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35769#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:16,991 INFO L273 TraceCheckUtils]: 95: Hoare triple {35769#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35770#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:16,992 INFO L273 TraceCheckUtils]: 96: Hoare triple {35770#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35770#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:16,992 INFO L273 TraceCheckUtils]: 97: Hoare triple {35770#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35770#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:16,993 INFO L273 TraceCheckUtils]: 98: Hoare triple {35770#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35771#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:16,994 INFO L273 TraceCheckUtils]: 99: Hoare triple {35771#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35771#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:16,994 INFO L273 TraceCheckUtils]: 100: Hoare triple {35771#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35771#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:16,995 INFO L273 TraceCheckUtils]: 101: Hoare triple {35771#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35772#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:16,996 INFO L273 TraceCheckUtils]: 102: Hoare triple {35772#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35772#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:16,996 INFO L273 TraceCheckUtils]: 103: Hoare triple {35772#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35772#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:16,997 INFO L273 TraceCheckUtils]: 104: Hoare triple {35772#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35773#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:16,997 INFO L273 TraceCheckUtils]: 105: Hoare triple {35773#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35773#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:16,998 INFO L273 TraceCheckUtils]: 106: Hoare triple {35773#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35773#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:16,999 INFO L273 TraceCheckUtils]: 107: Hoare triple {35773#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35774#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:16,999 INFO L273 TraceCheckUtils]: 108: Hoare triple {35774#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35774#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,000 INFO L273 TraceCheckUtils]: 109: Hoare triple {35774#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35774#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,001 INFO L273 TraceCheckUtils]: 110: Hoare triple {35774#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35775#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,001 INFO L273 TraceCheckUtils]: 111: Hoare triple {35775#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35775#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,002 INFO L273 TraceCheckUtils]: 112: Hoare triple {35775#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35775#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,003 INFO L273 TraceCheckUtils]: 113: Hoare triple {35775#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35776#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,003 INFO L273 TraceCheckUtils]: 114: Hoare triple {35776#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35776#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,004 INFO L273 TraceCheckUtils]: 115: Hoare triple {35776#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35776#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,005 INFO L273 TraceCheckUtils]: 116: Hoare triple {35776#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35777#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,005 INFO L273 TraceCheckUtils]: 117: Hoare triple {35777#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35777#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,006 INFO L273 TraceCheckUtils]: 118: Hoare triple {35777#(<= main_~i~0 37)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35777#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,007 INFO L273 TraceCheckUtils]: 119: Hoare triple {35777#(<= main_~i~0 37)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35778#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:17,007 INFO L273 TraceCheckUtils]: 120: Hoare triple {35778#(<= main_~i~0 38)} assume !(~i~0 < 100000); {35739#false} is VALID [2018-11-23 12:01:17,007 INFO L273 TraceCheckUtils]: 121: Hoare triple {35739#false} havoc ~x~0; {35739#false} is VALID [2018-11-23 12:01:17,008 INFO L273 TraceCheckUtils]: 122: Hoare triple {35739#false} assume 0 != ~rv~0;~x~0 := 0; {35739#false} is VALID [2018-11-23 12:01:17,008 INFO L273 TraceCheckUtils]: 123: Hoare triple {35739#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {35739#false} is VALID [2018-11-23 12:01:17,008 INFO L256 TraceCheckUtils]: 124: Hoare triple {35739#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {35739#false} is VALID [2018-11-23 12:01:17,008 INFO L273 TraceCheckUtils]: 125: Hoare triple {35739#false} ~cond := #in~cond; {35739#false} is VALID [2018-11-23 12:01:17,008 INFO L273 TraceCheckUtils]: 126: Hoare triple {35739#false} assume 0 == ~cond; {35739#false} is VALID [2018-11-23 12:01:17,009 INFO L273 TraceCheckUtils]: 127: Hoare triple {35739#false} assume !false; {35739#false} is VALID [2018-11-23 12:01:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:17,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:17,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:17,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:17,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:17,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:17,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {35738#true} call ULTIMATE.init(); {35738#true} is VALID [2018-11-23 12:01:17,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {35738#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35738#true} is VALID [2018-11-23 12:01:17,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {35738#true} assume true; {35738#true} is VALID [2018-11-23 12:01:17,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35738#true} {35738#true} #77#return; {35738#true} is VALID [2018-11-23 12:01:17,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {35738#true} call #t~ret9 := main(); {35738#true} is VALID [2018-11-23 12:01:17,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {35738#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {35797#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {35797#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35797#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {35797#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35797#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {35797#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35741#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {35741#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35741#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {35741#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35741#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {35741#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35742#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {35742#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35742#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {35742#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35742#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {35742#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35743#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {35743#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35743#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {35743#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35743#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,429 INFO L273 TraceCheckUtils]: 17: Hoare triple {35743#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35744#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,430 INFO L273 TraceCheckUtils]: 18: Hoare triple {35744#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35744#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {35744#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35744#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {35744#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35745#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {35745#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35745#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {35745#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35745#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {35745#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35746#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {35746#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35746#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {35746#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35746#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {35746#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35747#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,435 INFO L273 TraceCheckUtils]: 27: Hoare triple {35747#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35747#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {35747#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35747#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,436 INFO L273 TraceCheckUtils]: 29: Hoare triple {35747#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35748#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {35748#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35748#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {35748#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35748#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {35748#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35749#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {35749#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35749#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {35749#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35749#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {35749#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35750#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {35750#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35750#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {35750#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35750#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,442 INFO L273 TraceCheckUtils]: 38: Hoare triple {35750#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35751#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:17,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {35751#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35751#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:17,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {35751#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35751#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:17,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {35751#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35752#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:17,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {35752#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35752#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:17,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {35752#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35752#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:17,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {35752#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35753#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:17,446 INFO L273 TraceCheckUtils]: 45: Hoare triple {35753#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35753#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:17,446 INFO L273 TraceCheckUtils]: 46: Hoare triple {35753#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35753#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:17,447 INFO L273 TraceCheckUtils]: 47: Hoare triple {35753#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35754#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:17,448 INFO L273 TraceCheckUtils]: 48: Hoare triple {35754#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35754#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:17,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {35754#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35754#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:17,449 INFO L273 TraceCheckUtils]: 50: Hoare triple {35754#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35755#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:17,449 INFO L273 TraceCheckUtils]: 51: Hoare triple {35755#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35755#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:17,450 INFO L273 TraceCheckUtils]: 52: Hoare triple {35755#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35755#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:17,451 INFO L273 TraceCheckUtils]: 53: Hoare triple {35755#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35756#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:17,451 INFO L273 TraceCheckUtils]: 54: Hoare triple {35756#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35756#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:17,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {35756#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35756#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:17,452 INFO L273 TraceCheckUtils]: 56: Hoare triple {35756#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35757#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:17,453 INFO L273 TraceCheckUtils]: 57: Hoare triple {35757#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35757#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:17,453 INFO L273 TraceCheckUtils]: 58: Hoare triple {35757#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35757#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:17,454 INFO L273 TraceCheckUtils]: 59: Hoare triple {35757#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35758#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:17,455 INFO L273 TraceCheckUtils]: 60: Hoare triple {35758#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35758#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:17,455 INFO L273 TraceCheckUtils]: 61: Hoare triple {35758#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35758#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:17,456 INFO L273 TraceCheckUtils]: 62: Hoare triple {35758#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35759#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:17,457 INFO L273 TraceCheckUtils]: 63: Hoare triple {35759#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35759#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:17,457 INFO L273 TraceCheckUtils]: 64: Hoare triple {35759#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35759#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:17,458 INFO L273 TraceCheckUtils]: 65: Hoare triple {35759#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35760#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:17,458 INFO L273 TraceCheckUtils]: 66: Hoare triple {35760#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35760#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:17,459 INFO L273 TraceCheckUtils]: 67: Hoare triple {35760#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35760#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:17,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {35760#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35761#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:17,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {35761#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35761#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:17,461 INFO L273 TraceCheckUtils]: 70: Hoare triple {35761#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35761#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:17,461 INFO L273 TraceCheckUtils]: 71: Hoare triple {35761#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35762#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:17,462 INFO L273 TraceCheckUtils]: 72: Hoare triple {35762#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35762#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:17,462 INFO L273 TraceCheckUtils]: 73: Hoare triple {35762#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35762#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:17,463 INFO L273 TraceCheckUtils]: 74: Hoare triple {35762#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35763#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:17,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {35763#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35763#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:17,464 INFO L273 TraceCheckUtils]: 76: Hoare triple {35763#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35763#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:17,466 INFO L273 TraceCheckUtils]: 77: Hoare triple {35763#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35764#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:17,466 INFO L273 TraceCheckUtils]: 78: Hoare triple {35764#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35764#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:17,467 INFO L273 TraceCheckUtils]: 79: Hoare triple {35764#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35764#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:17,468 INFO L273 TraceCheckUtils]: 80: Hoare triple {35764#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35765#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:17,468 INFO L273 TraceCheckUtils]: 81: Hoare triple {35765#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35765#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:17,468 INFO L273 TraceCheckUtils]: 82: Hoare triple {35765#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35765#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:17,469 INFO L273 TraceCheckUtils]: 83: Hoare triple {35765#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35766#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:17,469 INFO L273 TraceCheckUtils]: 84: Hoare triple {35766#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35766#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:17,469 INFO L273 TraceCheckUtils]: 85: Hoare triple {35766#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35766#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:17,470 INFO L273 TraceCheckUtils]: 86: Hoare triple {35766#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35767#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:17,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {35767#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35767#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:17,471 INFO L273 TraceCheckUtils]: 88: Hoare triple {35767#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35767#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:17,472 INFO L273 TraceCheckUtils]: 89: Hoare triple {35767#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35768#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:17,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {35768#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35768#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:17,473 INFO L273 TraceCheckUtils]: 91: Hoare triple {35768#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35768#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:17,474 INFO L273 TraceCheckUtils]: 92: Hoare triple {35768#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35769#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:17,474 INFO L273 TraceCheckUtils]: 93: Hoare triple {35769#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35769#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:17,475 INFO L273 TraceCheckUtils]: 94: Hoare triple {35769#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35769#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:17,475 INFO L273 TraceCheckUtils]: 95: Hoare triple {35769#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35770#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:17,476 INFO L273 TraceCheckUtils]: 96: Hoare triple {35770#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35770#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:17,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {35770#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35770#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:17,477 INFO L273 TraceCheckUtils]: 98: Hoare triple {35770#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35771#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:17,478 INFO L273 TraceCheckUtils]: 99: Hoare triple {35771#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35771#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:17,478 INFO L273 TraceCheckUtils]: 100: Hoare triple {35771#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35771#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:17,479 INFO L273 TraceCheckUtils]: 101: Hoare triple {35771#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35772#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:17,480 INFO L273 TraceCheckUtils]: 102: Hoare triple {35772#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35772#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:17,480 INFO L273 TraceCheckUtils]: 103: Hoare triple {35772#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35772#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:17,481 INFO L273 TraceCheckUtils]: 104: Hoare triple {35772#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35773#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:17,481 INFO L273 TraceCheckUtils]: 105: Hoare triple {35773#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35773#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:17,482 INFO L273 TraceCheckUtils]: 106: Hoare triple {35773#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35773#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:17,483 INFO L273 TraceCheckUtils]: 107: Hoare triple {35773#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35774#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,483 INFO L273 TraceCheckUtils]: 108: Hoare triple {35774#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35774#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,484 INFO L273 TraceCheckUtils]: 109: Hoare triple {35774#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35774#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:17,484 INFO L273 TraceCheckUtils]: 110: Hoare triple {35774#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35775#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,485 INFO L273 TraceCheckUtils]: 111: Hoare triple {35775#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35775#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,485 INFO L273 TraceCheckUtils]: 112: Hoare triple {35775#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35775#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:17,486 INFO L273 TraceCheckUtils]: 113: Hoare triple {35775#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35776#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,487 INFO L273 TraceCheckUtils]: 114: Hoare triple {35776#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35776#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,487 INFO L273 TraceCheckUtils]: 115: Hoare triple {35776#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35776#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:17,488 INFO L273 TraceCheckUtils]: 116: Hoare triple {35776#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35777#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,488 INFO L273 TraceCheckUtils]: 117: Hoare triple {35777#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {35777#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,489 INFO L273 TraceCheckUtils]: 118: Hoare triple {35777#(<= main_~i~0 37)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {35777#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:17,490 INFO L273 TraceCheckUtils]: 119: Hoare triple {35777#(<= main_~i~0 37)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {35778#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:17,490 INFO L273 TraceCheckUtils]: 120: Hoare triple {35778#(<= main_~i~0 38)} assume !(~i~0 < 100000); {35739#false} is VALID [2018-11-23 12:01:17,491 INFO L273 TraceCheckUtils]: 121: Hoare triple {35739#false} havoc ~x~0; {35739#false} is VALID [2018-11-23 12:01:17,491 INFO L273 TraceCheckUtils]: 122: Hoare triple {35739#false} assume 0 != ~rv~0;~x~0 := 0; {35739#false} is VALID [2018-11-23 12:01:17,491 INFO L273 TraceCheckUtils]: 123: Hoare triple {35739#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {35739#false} is VALID [2018-11-23 12:01:17,491 INFO L256 TraceCheckUtils]: 124: Hoare triple {35739#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {35739#false} is VALID [2018-11-23 12:01:17,491 INFO L273 TraceCheckUtils]: 125: Hoare triple {35739#false} ~cond := #in~cond; {35739#false} is VALID [2018-11-23 12:01:17,491 INFO L273 TraceCheckUtils]: 126: Hoare triple {35739#false} assume 0 == ~cond; {35739#false} is VALID [2018-11-23 12:01:17,492 INFO L273 TraceCheckUtils]: 127: Hoare triple {35739#false} assume !false; {35739#false} is VALID [2018-11-23 12:01:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:17,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:17,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:01:17,523 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2018-11-23 12:01:17,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:17,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:01:17,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:17,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:01:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:01:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:01:17,701 INFO L87 Difference]: Start difference. First operand 253 states and 333 transitions. Second operand 42 states. [2018-11-23 12:01:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:18,195 INFO L93 Difference]: Finished difference Result 282 states and 371 transitions. [2018-11-23 12:01:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:01:18,195 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2018-11-23 12:01:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:01:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 208 transitions. [2018-11-23 12:01:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:01:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 208 transitions. [2018-11-23 12:01:18,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 208 transitions. [2018-11-23 12:01:18,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:18,387 INFO L225 Difference]: With dead ends: 282 [2018-11-23 12:01:18,387 INFO L226 Difference]: Without dead ends: 263 [2018-11-23 12:01:18,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:01:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-23 12:01:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2018-11-23 12:01:18,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:18,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand 259 states. [2018-11-23 12:01:18,502 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 259 states. [2018-11-23 12:01:18,502 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 259 states. [2018-11-23 12:01:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:18,507 INFO L93 Difference]: Finished difference Result 263 states and 347 transitions. [2018-11-23 12:01:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2018-11-23 12:01:18,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:18,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:18,508 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 263 states. [2018-11-23 12:01:18,508 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 263 states. [2018-11-23 12:01:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:18,512 INFO L93 Difference]: Finished difference Result 263 states and 347 transitions. [2018-11-23 12:01:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2018-11-23 12:01:18,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:18,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:18,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:18,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-23 12:01:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 341 transitions. [2018-11-23 12:01:18,518 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 341 transitions. Word has length 128 [2018-11-23 12:01:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:18,518 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 341 transitions. [2018-11-23 12:01:18,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:01:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 341 transitions. [2018-11-23 12:01:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 12:01:18,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:18,519 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:18,519 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:18,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1422273568, now seen corresponding path program 39 times [2018-11-23 12:01:18,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:18,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:18,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:19,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {37411#true} call ULTIMATE.init(); {37411#true} is VALID [2018-11-23 12:01:19,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {37411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37411#true} is VALID [2018-11-23 12:01:19,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {37411#true} assume true; {37411#true} is VALID [2018-11-23 12:01:19,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37411#true} {37411#true} #77#return; {37411#true} is VALID [2018-11-23 12:01:19,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {37411#true} call #t~ret9 := main(); {37411#true} is VALID [2018-11-23 12:01:19,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {37411#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {37413#(= main_~i~0 0)} is VALID [2018-11-23 12:01:19,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {37413#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37413#(= main_~i~0 0)} is VALID [2018-11-23 12:01:19,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {37413#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37413#(= main_~i~0 0)} is VALID [2018-11-23 12:01:19,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {37413#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37414#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:19,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {37414#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37414#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:19,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {37414#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37414#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:19,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {37414#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37415#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:19,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {37415#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37415#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:19,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {37415#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37415#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:19,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {37415#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37416#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:19,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {37416#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37416#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:19,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {37416#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37416#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:19,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {37416#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37417#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:19,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {37417#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37417#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:19,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {37417#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37417#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:19,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {37417#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37418#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:19,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {37418#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37418#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:19,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {37418#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37418#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:19,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {37418#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37419#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:19,420 INFO L273 TraceCheckUtils]: 24: Hoare triple {37419#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37419#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:19,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {37419#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37419#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:19,421 INFO L273 TraceCheckUtils]: 26: Hoare triple {37419#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37420#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:19,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {37420#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37420#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:19,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {37420#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37420#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:19,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {37420#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37421#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:19,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {37421#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37421#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:19,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {37421#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37421#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:19,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {37421#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37422#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:19,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {37422#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37422#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:19,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {37422#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37422#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:19,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {37422#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37423#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:19,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {37423#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37423#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:19,428 INFO L273 TraceCheckUtils]: 37: Hoare triple {37423#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37423#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:19,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {37423#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37424#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:19,429 INFO L273 TraceCheckUtils]: 39: Hoare triple {37424#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37424#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:19,430 INFO L273 TraceCheckUtils]: 40: Hoare triple {37424#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37424#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:19,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {37424#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37425#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:19,431 INFO L273 TraceCheckUtils]: 42: Hoare triple {37425#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37425#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:19,432 INFO L273 TraceCheckUtils]: 43: Hoare triple {37425#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37425#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:19,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {37425#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37426#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:19,433 INFO L273 TraceCheckUtils]: 45: Hoare triple {37426#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37426#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:19,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {37426#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37426#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:19,435 INFO L273 TraceCheckUtils]: 47: Hoare triple {37426#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37427#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:19,435 INFO L273 TraceCheckUtils]: 48: Hoare triple {37427#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37427#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:19,436 INFO L273 TraceCheckUtils]: 49: Hoare triple {37427#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37427#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:19,437 INFO L273 TraceCheckUtils]: 50: Hoare triple {37427#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37428#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:19,437 INFO L273 TraceCheckUtils]: 51: Hoare triple {37428#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37428#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:19,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {37428#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37428#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:19,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {37428#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37429#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:19,439 INFO L273 TraceCheckUtils]: 54: Hoare triple {37429#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37429#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:19,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {37429#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37429#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:19,441 INFO L273 TraceCheckUtils]: 56: Hoare triple {37429#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37430#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:19,441 INFO L273 TraceCheckUtils]: 57: Hoare triple {37430#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37430#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:19,442 INFO L273 TraceCheckUtils]: 58: Hoare triple {37430#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37430#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:19,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {37430#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37431#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:19,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {37431#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37431#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:19,444 INFO L273 TraceCheckUtils]: 61: Hoare triple {37431#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37431#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:19,445 INFO L273 TraceCheckUtils]: 62: Hoare triple {37431#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37432#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:19,445 INFO L273 TraceCheckUtils]: 63: Hoare triple {37432#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37432#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:19,446 INFO L273 TraceCheckUtils]: 64: Hoare triple {37432#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37432#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:19,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {37432#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37433#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:19,447 INFO L273 TraceCheckUtils]: 66: Hoare triple {37433#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37433#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:19,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {37433#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37433#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:19,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {37433#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37434#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:19,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {37434#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37434#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:19,450 INFO L273 TraceCheckUtils]: 70: Hoare triple {37434#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37434#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:19,451 INFO L273 TraceCheckUtils]: 71: Hoare triple {37434#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37435#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:19,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {37435#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37435#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:19,452 INFO L273 TraceCheckUtils]: 73: Hoare triple {37435#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37435#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:19,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {37435#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37436#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:19,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {37436#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37436#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:19,454 INFO L273 TraceCheckUtils]: 76: Hoare triple {37436#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37436#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:19,475 INFO L273 TraceCheckUtils]: 77: Hoare triple {37436#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37437#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:19,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {37437#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37437#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:19,500 INFO L273 TraceCheckUtils]: 79: Hoare triple {37437#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37437#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:19,501 INFO L273 TraceCheckUtils]: 80: Hoare triple {37437#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37438#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:19,501 INFO L273 TraceCheckUtils]: 81: Hoare triple {37438#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37438#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:19,501 INFO L273 TraceCheckUtils]: 82: Hoare triple {37438#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37438#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:19,502 INFO L273 TraceCheckUtils]: 83: Hoare triple {37438#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37439#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:19,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {37439#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37439#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:19,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {37439#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37439#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:19,503 INFO L273 TraceCheckUtils]: 86: Hoare triple {37439#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37440#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:19,503 INFO L273 TraceCheckUtils]: 87: Hoare triple {37440#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37440#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:19,504 INFO L273 TraceCheckUtils]: 88: Hoare triple {37440#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37440#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:19,504 INFO L273 TraceCheckUtils]: 89: Hoare triple {37440#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37441#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:19,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {37441#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37441#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:19,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {37441#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37441#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:19,506 INFO L273 TraceCheckUtils]: 92: Hoare triple {37441#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37442#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:19,507 INFO L273 TraceCheckUtils]: 93: Hoare triple {37442#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37442#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:19,507 INFO L273 TraceCheckUtils]: 94: Hoare triple {37442#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37442#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:19,508 INFO L273 TraceCheckUtils]: 95: Hoare triple {37442#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37443#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:19,509 INFO L273 TraceCheckUtils]: 96: Hoare triple {37443#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37443#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:19,509 INFO L273 TraceCheckUtils]: 97: Hoare triple {37443#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37443#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:19,510 INFO L273 TraceCheckUtils]: 98: Hoare triple {37443#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37444#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:19,510 INFO L273 TraceCheckUtils]: 99: Hoare triple {37444#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37444#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:19,511 INFO L273 TraceCheckUtils]: 100: Hoare triple {37444#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37444#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:19,512 INFO L273 TraceCheckUtils]: 101: Hoare triple {37444#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37445#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:19,512 INFO L273 TraceCheckUtils]: 102: Hoare triple {37445#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37445#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:19,513 INFO L273 TraceCheckUtils]: 103: Hoare triple {37445#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37445#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:19,514 INFO L273 TraceCheckUtils]: 104: Hoare triple {37445#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37446#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:19,514 INFO L273 TraceCheckUtils]: 105: Hoare triple {37446#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37446#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:19,515 INFO L273 TraceCheckUtils]: 106: Hoare triple {37446#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37446#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:19,516 INFO L273 TraceCheckUtils]: 107: Hoare triple {37446#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37447#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:19,516 INFO L273 TraceCheckUtils]: 108: Hoare triple {37447#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37447#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:19,517 INFO L273 TraceCheckUtils]: 109: Hoare triple {37447#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37447#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:19,518 INFO L273 TraceCheckUtils]: 110: Hoare triple {37447#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37448#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:19,518 INFO L273 TraceCheckUtils]: 111: Hoare triple {37448#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37448#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:19,519 INFO L273 TraceCheckUtils]: 112: Hoare triple {37448#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37448#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:19,520 INFO L273 TraceCheckUtils]: 113: Hoare triple {37448#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37449#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:19,520 INFO L273 TraceCheckUtils]: 114: Hoare triple {37449#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37449#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:19,521 INFO L273 TraceCheckUtils]: 115: Hoare triple {37449#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37449#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:19,522 INFO L273 TraceCheckUtils]: 116: Hoare triple {37449#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37450#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:19,522 INFO L273 TraceCheckUtils]: 117: Hoare triple {37450#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37450#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:19,523 INFO L273 TraceCheckUtils]: 118: Hoare triple {37450#(<= main_~i~0 37)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37450#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:19,524 INFO L273 TraceCheckUtils]: 119: Hoare triple {37450#(<= main_~i~0 37)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37451#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:19,524 INFO L273 TraceCheckUtils]: 120: Hoare triple {37451#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37451#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:19,525 INFO L273 TraceCheckUtils]: 121: Hoare triple {37451#(<= main_~i~0 38)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37451#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:19,526 INFO L273 TraceCheckUtils]: 122: Hoare triple {37451#(<= main_~i~0 38)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37452#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:19,526 INFO L273 TraceCheckUtils]: 123: Hoare triple {37452#(<= main_~i~0 39)} assume !(~i~0 < 100000); {37412#false} is VALID [2018-11-23 12:01:19,527 INFO L273 TraceCheckUtils]: 124: Hoare triple {37412#false} havoc ~x~0; {37412#false} is VALID [2018-11-23 12:01:19,527 INFO L273 TraceCheckUtils]: 125: Hoare triple {37412#false} assume 0 != ~rv~0;~x~0 := 0; {37412#false} is VALID [2018-11-23 12:01:19,527 INFO L273 TraceCheckUtils]: 126: Hoare triple {37412#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {37412#false} is VALID [2018-11-23 12:01:19,527 INFO L256 TraceCheckUtils]: 127: Hoare triple {37412#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {37412#false} is VALID [2018-11-23 12:01:19,527 INFO L273 TraceCheckUtils]: 128: Hoare triple {37412#false} ~cond := #in~cond; {37412#false} is VALID [2018-11-23 12:01:19,527 INFO L273 TraceCheckUtils]: 129: Hoare triple {37412#false} assume 0 == ~cond; {37412#false} is VALID [2018-11-23 12:01:19,528 INFO L273 TraceCheckUtils]: 130: Hoare triple {37412#false} assume !false; {37412#false} is VALID [2018-11-23 12:01:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:19,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:19,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:19,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:43,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 12:01:43,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:43,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:44,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {37411#true} call ULTIMATE.init(); {37411#true} is VALID [2018-11-23 12:01:44,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {37411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37411#true} is VALID [2018-11-23 12:01:44,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {37411#true} assume true; {37411#true} is VALID [2018-11-23 12:01:44,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37411#true} {37411#true} #77#return; {37411#true} is VALID [2018-11-23 12:01:44,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {37411#true} call #t~ret9 := main(); {37411#true} is VALID [2018-11-23 12:01:44,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {37411#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {37471#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:44,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {37471#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37471#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:44,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {37471#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37471#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:44,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {37471#(<= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37414#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:44,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {37414#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37414#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:44,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {37414#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37414#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:44,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {37414#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37415#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:44,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {37415#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37415#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:44,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {37415#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37415#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:44,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {37415#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37416#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:44,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {37416#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37416#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:44,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {37416#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37416#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:44,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {37416#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37417#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:44,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {37417#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37417#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:44,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {37417#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37417#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:44,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {37417#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37418#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:44,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {37418#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37418#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:44,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {37418#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37418#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:44,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {37418#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37419#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:44,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {37419#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37419#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:44,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {37419#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37419#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:44,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {37419#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37420#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:44,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {37420#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37420#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:44,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {37420#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37420#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:44,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {37420#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37421#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:44,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {37421#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37421#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:44,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {37421#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37421#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:44,304 INFO L273 TraceCheckUtils]: 32: Hoare triple {37421#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37422#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:44,305 INFO L273 TraceCheckUtils]: 33: Hoare triple {37422#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37422#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:44,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {37422#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37422#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:44,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {37422#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37423#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:44,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {37423#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37423#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:44,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {37423#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37423#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:44,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {37423#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37424#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:44,309 INFO L273 TraceCheckUtils]: 39: Hoare triple {37424#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37424#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:44,309 INFO L273 TraceCheckUtils]: 40: Hoare triple {37424#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37424#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:44,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {37424#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37425#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:44,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {37425#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37425#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:44,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {37425#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37425#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:44,312 INFO L273 TraceCheckUtils]: 44: Hoare triple {37425#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37426#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:44,312 INFO L273 TraceCheckUtils]: 45: Hoare triple {37426#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37426#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:44,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {37426#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37426#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:44,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {37426#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37427#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:44,314 INFO L273 TraceCheckUtils]: 48: Hoare triple {37427#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37427#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:44,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {37427#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37427#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:44,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {37427#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37428#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:44,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {37428#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37428#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:44,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {37428#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37428#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:44,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {37428#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37429#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:44,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {37429#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37429#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:44,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {37429#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37429#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:44,320 INFO L273 TraceCheckUtils]: 56: Hoare triple {37429#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37430#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:44,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {37430#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37430#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:44,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {37430#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37430#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:44,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {37430#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37431#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:44,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {37431#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37431#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:44,323 INFO L273 TraceCheckUtils]: 61: Hoare triple {37431#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37431#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:44,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {37431#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37432#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:44,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {37432#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37432#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:44,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {37432#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37432#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:44,326 INFO L273 TraceCheckUtils]: 65: Hoare triple {37432#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37433#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:44,326 INFO L273 TraceCheckUtils]: 66: Hoare triple {37433#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37433#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:44,327 INFO L273 TraceCheckUtils]: 67: Hoare triple {37433#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37433#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:44,327 INFO L273 TraceCheckUtils]: 68: Hoare triple {37433#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37434#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:44,328 INFO L273 TraceCheckUtils]: 69: Hoare triple {37434#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37434#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:44,328 INFO L273 TraceCheckUtils]: 70: Hoare triple {37434#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37434#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:44,329 INFO L273 TraceCheckUtils]: 71: Hoare triple {37434#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37435#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:44,330 INFO L273 TraceCheckUtils]: 72: Hoare triple {37435#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37435#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:44,330 INFO L273 TraceCheckUtils]: 73: Hoare triple {37435#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37435#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:44,331 INFO L273 TraceCheckUtils]: 74: Hoare triple {37435#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37436#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:44,332 INFO L273 TraceCheckUtils]: 75: Hoare triple {37436#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37436#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:44,332 INFO L273 TraceCheckUtils]: 76: Hoare triple {37436#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37436#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:44,333 INFO L273 TraceCheckUtils]: 77: Hoare triple {37436#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37437#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:44,334 INFO L273 TraceCheckUtils]: 78: Hoare triple {37437#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37437#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:44,334 INFO L273 TraceCheckUtils]: 79: Hoare triple {37437#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37437#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:44,335 INFO L273 TraceCheckUtils]: 80: Hoare triple {37437#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37438#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:44,336 INFO L273 TraceCheckUtils]: 81: Hoare triple {37438#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37438#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:44,336 INFO L273 TraceCheckUtils]: 82: Hoare triple {37438#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37438#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:44,337 INFO L273 TraceCheckUtils]: 83: Hoare triple {37438#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37439#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:44,338 INFO L273 TraceCheckUtils]: 84: Hoare triple {37439#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37439#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:44,338 INFO L273 TraceCheckUtils]: 85: Hoare triple {37439#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37439#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:44,339 INFO L273 TraceCheckUtils]: 86: Hoare triple {37439#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37440#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:44,340 INFO L273 TraceCheckUtils]: 87: Hoare triple {37440#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37440#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:44,340 INFO L273 TraceCheckUtils]: 88: Hoare triple {37440#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37440#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:44,341 INFO L273 TraceCheckUtils]: 89: Hoare triple {37440#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37441#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:44,341 INFO L273 TraceCheckUtils]: 90: Hoare triple {37441#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37441#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:44,342 INFO L273 TraceCheckUtils]: 91: Hoare triple {37441#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37441#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:44,343 INFO L273 TraceCheckUtils]: 92: Hoare triple {37441#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37442#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:44,343 INFO L273 TraceCheckUtils]: 93: Hoare triple {37442#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37442#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:44,344 INFO L273 TraceCheckUtils]: 94: Hoare triple {37442#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37442#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:44,345 INFO L273 TraceCheckUtils]: 95: Hoare triple {37442#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37443#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:44,345 INFO L273 TraceCheckUtils]: 96: Hoare triple {37443#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37443#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:44,346 INFO L273 TraceCheckUtils]: 97: Hoare triple {37443#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37443#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:44,347 INFO L273 TraceCheckUtils]: 98: Hoare triple {37443#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37444#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:44,347 INFO L273 TraceCheckUtils]: 99: Hoare triple {37444#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37444#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:44,348 INFO L273 TraceCheckUtils]: 100: Hoare triple {37444#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37444#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:44,349 INFO L273 TraceCheckUtils]: 101: Hoare triple {37444#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37445#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:44,349 INFO L273 TraceCheckUtils]: 102: Hoare triple {37445#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37445#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:44,350 INFO L273 TraceCheckUtils]: 103: Hoare triple {37445#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37445#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:44,351 INFO L273 TraceCheckUtils]: 104: Hoare triple {37445#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37446#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:44,351 INFO L273 TraceCheckUtils]: 105: Hoare triple {37446#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37446#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:44,352 INFO L273 TraceCheckUtils]: 106: Hoare triple {37446#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37446#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:44,353 INFO L273 TraceCheckUtils]: 107: Hoare triple {37446#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37447#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:44,353 INFO L273 TraceCheckUtils]: 108: Hoare triple {37447#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37447#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:44,354 INFO L273 TraceCheckUtils]: 109: Hoare triple {37447#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37447#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:44,355 INFO L273 TraceCheckUtils]: 110: Hoare triple {37447#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37448#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:44,355 INFO L273 TraceCheckUtils]: 111: Hoare triple {37448#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37448#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:44,356 INFO L273 TraceCheckUtils]: 112: Hoare triple {37448#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37448#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:44,356 INFO L273 TraceCheckUtils]: 113: Hoare triple {37448#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37449#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:44,357 INFO L273 TraceCheckUtils]: 114: Hoare triple {37449#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37449#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:44,357 INFO L273 TraceCheckUtils]: 115: Hoare triple {37449#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37449#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:44,358 INFO L273 TraceCheckUtils]: 116: Hoare triple {37449#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37450#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:44,359 INFO L273 TraceCheckUtils]: 117: Hoare triple {37450#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37450#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:44,359 INFO L273 TraceCheckUtils]: 118: Hoare triple {37450#(<= main_~i~0 37)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37450#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:44,360 INFO L273 TraceCheckUtils]: 119: Hoare triple {37450#(<= main_~i~0 37)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37451#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:44,361 INFO L273 TraceCheckUtils]: 120: Hoare triple {37451#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {37451#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:44,361 INFO L273 TraceCheckUtils]: 121: Hoare triple {37451#(<= main_~i~0 38)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {37451#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:44,362 INFO L273 TraceCheckUtils]: 122: Hoare triple {37451#(<= main_~i~0 38)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {37452#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:44,363 INFO L273 TraceCheckUtils]: 123: Hoare triple {37452#(<= main_~i~0 39)} assume !(~i~0 < 100000); {37412#false} is VALID [2018-11-23 12:01:44,363 INFO L273 TraceCheckUtils]: 124: Hoare triple {37412#false} havoc ~x~0; {37412#false} is VALID [2018-11-23 12:01:44,363 INFO L273 TraceCheckUtils]: 125: Hoare triple {37412#false} assume 0 != ~rv~0;~x~0 := 0; {37412#false} is VALID [2018-11-23 12:01:44,363 INFO L273 TraceCheckUtils]: 126: Hoare triple {37412#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {37412#false} is VALID [2018-11-23 12:01:44,364 INFO L256 TraceCheckUtils]: 127: Hoare triple {37412#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {37412#false} is VALID [2018-11-23 12:01:44,364 INFO L273 TraceCheckUtils]: 128: Hoare triple {37412#false} ~cond := #in~cond; {37412#false} is VALID [2018-11-23 12:01:44,364 INFO L273 TraceCheckUtils]: 129: Hoare triple {37412#false} assume 0 == ~cond; {37412#false} is VALID [2018-11-23 12:01:44,364 INFO L273 TraceCheckUtils]: 130: Hoare triple {37412#false} assume !false; {37412#false} is VALID [2018-11-23 12:01:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:44,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:44,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:01:44,398 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2018-11-23 12:01:44,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:44,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:01:44,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:44,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:01:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:01:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:01:44,537 INFO L87 Difference]: Start difference. First operand 259 states and 341 transitions. Second operand 43 states. [2018-11-23 12:01:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:45,224 INFO L93 Difference]: Finished difference Result 288 states and 379 transitions. [2018-11-23 12:01:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:01:45,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2018-11-23 12:01:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:01:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 212 transitions. [2018-11-23 12:01:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:01:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 212 transitions. [2018-11-23 12:01:45,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 212 transitions. [2018-11-23 12:01:45,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:45,541 INFO L225 Difference]: With dead ends: 288 [2018-11-23 12:01:45,541 INFO L226 Difference]: Without dead ends: 269 [2018-11-23 12:01:45,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:01:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-23 12:01:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-11-23 12:01:45,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:45,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand 265 states. [2018-11-23 12:01:45,632 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 265 states. [2018-11-23 12:01:45,632 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 265 states. [2018-11-23 12:01:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:45,639 INFO L93 Difference]: Finished difference Result 269 states and 355 transitions. [2018-11-23 12:01:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 355 transitions. [2018-11-23 12:01:45,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:45,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:45,639 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 269 states. [2018-11-23 12:01:45,640 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 269 states. [2018-11-23 12:01:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:45,644 INFO L93 Difference]: Finished difference Result 269 states and 355 transitions. [2018-11-23 12:01:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 355 transitions. [2018-11-23 12:01:45,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:45,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:45,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:45,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-23 12:01:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 349 transitions. [2018-11-23 12:01:45,649 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 349 transitions. Word has length 131 [2018-11-23 12:01:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:45,649 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 349 transitions. [2018-11-23 12:01:45,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:01:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 349 transitions. [2018-11-23 12:01:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 12:01:45,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:45,650 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:45,650 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:45,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1212608224, now seen corresponding path program 40 times [2018-11-23 12:01:45,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:45,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:45,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:46,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {39122#true} call ULTIMATE.init(); {39122#true} is VALID [2018-11-23 12:01:46,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {39122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39122#true} is VALID [2018-11-23 12:01:46,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {39122#true} assume true; {39122#true} is VALID [2018-11-23 12:01:46,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39122#true} {39122#true} #77#return; {39122#true} is VALID [2018-11-23 12:01:46,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {39122#true} call #t~ret9 := main(); {39122#true} is VALID [2018-11-23 12:01:46,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {39122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000);~rv~0 := 1; {39124#(= main_~i~0 0)} is VALID [2018-11-23 12:01:46,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {39124#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39124#(= main_~i~0 0)} is VALID [2018-11-23 12:01:46,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {39124#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39124#(= main_~i~0 0)} is VALID [2018-11-23 12:01:46,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {39124#(= main_~i~0 0)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:46,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {39125#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:46,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {39125#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39125#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:46,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {39125#(<= main_~i~0 1)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:46,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {39126#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:46,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {39126#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39126#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:46,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {39126#(<= main_~i~0 2)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:46,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {39127#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:46,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {39127#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39127#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:46,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {39127#(<= main_~i~0 3)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:46,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {39128#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:46,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {39128#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39128#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:46,602 INFO L273 TraceCheckUtils]: 20: Hoare triple {39128#(<= main_~i~0 4)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:46,602 INFO L273 TraceCheckUtils]: 21: Hoare triple {39129#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:46,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {39129#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39129#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:46,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {39129#(<= main_~i~0 5)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:46,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {39130#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:46,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {39130#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39130#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:46,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {39130#(<= main_~i~0 6)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:46,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {39131#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:46,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {39131#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39131#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:46,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {39131#(<= main_~i~0 7)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:46,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {39132#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39132#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:46,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {39132#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39132#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:46,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {39132#(<= main_~i~0 8)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39133#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:46,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {39133#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39133#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:46,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {39133#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39133#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:46,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {39133#(<= main_~i~0 9)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39134#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:46,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {39134#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39134#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:46,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {39134#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39134#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:46,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {39134#(<= main_~i~0 10)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39135#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:46,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {39135#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39135#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:46,628 INFO L273 TraceCheckUtils]: 40: Hoare triple {39135#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39135#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:46,628 INFO L273 TraceCheckUtils]: 41: Hoare triple {39135#(<= main_~i~0 11)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39136#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:46,630 INFO L273 TraceCheckUtils]: 42: Hoare triple {39136#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39136#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:46,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {39136#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39136#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:46,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {39136#(<= main_~i~0 12)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39137#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:46,633 INFO L273 TraceCheckUtils]: 45: Hoare triple {39137#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39137#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:46,635 INFO L273 TraceCheckUtils]: 46: Hoare triple {39137#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39137#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:46,638 INFO L273 TraceCheckUtils]: 47: Hoare triple {39137#(<= main_~i~0 13)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39138#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:46,640 INFO L273 TraceCheckUtils]: 48: Hoare triple {39138#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39138#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:46,640 INFO L273 TraceCheckUtils]: 49: Hoare triple {39138#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39138#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:46,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {39138#(<= main_~i~0 14)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39139#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:46,642 INFO L273 TraceCheckUtils]: 51: Hoare triple {39139#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39139#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:46,645 INFO L273 TraceCheckUtils]: 52: Hoare triple {39139#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39139#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:46,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {39139#(<= main_~i~0 15)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39140#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:46,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {39140#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39140#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:46,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {39140#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39140#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:46,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {39140#(<= main_~i~0 16)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39141#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:46,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {39141#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39141#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:46,651 INFO L273 TraceCheckUtils]: 58: Hoare triple {39141#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39141#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:46,651 INFO L273 TraceCheckUtils]: 59: Hoare triple {39141#(<= main_~i~0 17)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39142#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:46,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {39142#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39142#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:46,654 INFO L273 TraceCheckUtils]: 61: Hoare triple {39142#(<= main_~i~0 18)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39142#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:46,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {39142#(<= main_~i~0 18)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39143#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:46,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {39143#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39143#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:46,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {39143#(<= main_~i~0 19)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39143#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:46,659 INFO L273 TraceCheckUtils]: 65: Hoare triple {39143#(<= main_~i~0 19)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39144#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:46,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {39144#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39144#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:46,660 INFO L273 TraceCheckUtils]: 67: Hoare triple {39144#(<= main_~i~0 20)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39144#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:46,662 INFO L273 TraceCheckUtils]: 68: Hoare triple {39144#(<= main_~i~0 20)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39145#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:46,662 INFO L273 TraceCheckUtils]: 69: Hoare triple {39145#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39145#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:46,665 INFO L273 TraceCheckUtils]: 70: Hoare triple {39145#(<= main_~i~0 21)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39145#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:46,665 INFO L273 TraceCheckUtils]: 71: Hoare triple {39145#(<= main_~i~0 21)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39146#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:46,668 INFO L273 TraceCheckUtils]: 72: Hoare triple {39146#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39146#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:46,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {39146#(<= main_~i~0 22)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39146#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:46,670 INFO L273 TraceCheckUtils]: 74: Hoare triple {39146#(<= main_~i~0 22)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39147#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:46,670 INFO L273 TraceCheckUtils]: 75: Hoare triple {39147#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39147#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:46,673 INFO L273 TraceCheckUtils]: 76: Hoare triple {39147#(<= main_~i~0 23)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39147#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:46,673 INFO L273 TraceCheckUtils]: 77: Hoare triple {39147#(<= main_~i~0 23)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39148#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:46,675 INFO L273 TraceCheckUtils]: 78: Hoare triple {39148#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39148#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:46,675 INFO L273 TraceCheckUtils]: 79: Hoare triple {39148#(<= main_~i~0 24)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39148#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:46,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {39148#(<= main_~i~0 24)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39149#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:46,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {39149#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39149#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:46,680 INFO L273 TraceCheckUtils]: 82: Hoare triple {39149#(<= main_~i~0 25)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39149#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:46,680 INFO L273 TraceCheckUtils]: 83: Hoare triple {39149#(<= main_~i~0 25)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39150#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:46,682 INFO L273 TraceCheckUtils]: 84: Hoare triple {39150#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39150#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:46,682 INFO L273 TraceCheckUtils]: 85: Hoare triple {39150#(<= main_~i~0 26)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39150#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:46,684 INFO L273 TraceCheckUtils]: 86: Hoare triple {39150#(<= main_~i~0 26)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39151#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:46,684 INFO L273 TraceCheckUtils]: 87: Hoare triple {39151#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39151#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:46,687 INFO L273 TraceCheckUtils]: 88: Hoare triple {39151#(<= main_~i~0 27)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39151#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:46,687 INFO L273 TraceCheckUtils]: 89: Hoare triple {39151#(<= main_~i~0 27)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39152#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:46,690 INFO L273 TraceCheckUtils]: 90: Hoare triple {39152#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39152#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:46,690 INFO L273 TraceCheckUtils]: 91: Hoare triple {39152#(<= main_~i~0 28)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39152#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:46,693 INFO L273 TraceCheckUtils]: 92: Hoare triple {39152#(<= main_~i~0 28)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39153#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:46,693 INFO L273 TraceCheckUtils]: 93: Hoare triple {39153#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39153#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:46,695 INFO L273 TraceCheckUtils]: 94: Hoare triple {39153#(<= main_~i~0 29)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39153#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:46,695 INFO L273 TraceCheckUtils]: 95: Hoare triple {39153#(<= main_~i~0 29)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39154#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:46,697 INFO L273 TraceCheckUtils]: 96: Hoare triple {39154#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39154#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:46,697 INFO L273 TraceCheckUtils]: 97: Hoare triple {39154#(<= main_~i~0 30)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39154#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:46,700 INFO L273 TraceCheckUtils]: 98: Hoare triple {39154#(<= main_~i~0 30)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39155#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:46,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {39155#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39155#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:46,703 INFO L273 TraceCheckUtils]: 100: Hoare triple {39155#(<= main_~i~0 31)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39155#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:46,703 INFO L273 TraceCheckUtils]: 101: Hoare triple {39155#(<= main_~i~0 31)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39156#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:46,705 INFO L273 TraceCheckUtils]: 102: Hoare triple {39156#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39156#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:46,705 INFO L273 TraceCheckUtils]: 103: Hoare triple {39156#(<= main_~i~0 32)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39156#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:46,708 INFO L273 TraceCheckUtils]: 104: Hoare triple {39156#(<= main_~i~0 32)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39157#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:46,708 INFO L273 TraceCheckUtils]: 105: Hoare triple {39157#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39157#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:46,710 INFO L273 TraceCheckUtils]: 106: Hoare triple {39157#(<= main_~i~0 33)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39157#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:46,710 INFO L273 TraceCheckUtils]: 107: Hoare triple {39157#(<= main_~i~0 33)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39158#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:46,713 INFO L273 TraceCheckUtils]: 108: Hoare triple {39158#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39158#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:46,713 INFO L273 TraceCheckUtils]: 109: Hoare triple {39158#(<= main_~i~0 34)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39158#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:46,716 INFO L273 TraceCheckUtils]: 110: Hoare triple {39158#(<= main_~i~0 34)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39159#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:46,716 INFO L273 TraceCheckUtils]: 111: Hoare triple {39159#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39159#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:46,718 INFO L273 TraceCheckUtils]: 112: Hoare triple {39159#(<= main_~i~0 35)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39159#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:46,718 INFO L273 TraceCheckUtils]: 113: Hoare triple {39159#(<= main_~i~0 35)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39160#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:46,721 INFO L273 TraceCheckUtils]: 114: Hoare triple {39160#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39160#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:46,721 INFO L273 TraceCheckUtils]: 115: Hoare triple {39160#(<= main_~i~0 36)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39160#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:46,724 INFO L273 TraceCheckUtils]: 116: Hoare triple {39160#(<= main_~i~0 36)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39161#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:46,724 INFO L273 TraceCheckUtils]: 117: Hoare triple {39161#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39161#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:46,727 INFO L273 TraceCheckUtils]: 118: Hoare triple {39161#(<= main_~i~0 37)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39161#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:46,727 INFO L273 TraceCheckUtils]: 119: Hoare triple {39161#(<= main_~i~0 37)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39162#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:46,729 INFO L273 TraceCheckUtils]: 120: Hoare triple {39162#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39162#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:46,729 INFO L273 TraceCheckUtils]: 121: Hoare triple {39162#(<= main_~i~0 38)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39162#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:46,731 INFO L273 TraceCheckUtils]: 122: Hoare triple {39162#(<= main_~i~0 38)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39163#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:46,731 INFO L273 TraceCheckUtils]: 123: Hoare triple {39163#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {39163#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:46,734 INFO L273 TraceCheckUtils]: 124: Hoare triple {39163#(<= main_~i~0 39)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {39163#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:46,734 INFO L273 TraceCheckUtils]: 125: Hoare triple {39163#(<= main_~i~0 39)} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#c~0.base, ~#c~0.offset + 4 * ~i~0, 4);havoc #t~mem2;~i~0 := 1 + ~i~0; {39164#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 126: Hoare triple {39164#(<= main_~i~0 40)} assume !(~i~0 < 100000); {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 127: Hoare triple {39123#false} havoc ~x~0; {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 128: Hoare triple {39123#false} assume 0 != ~rv~0;~x~0 := 0; {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 129: Hoare triple {39123#false} assume !!(~x~0 < 100000);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L256 TraceCheckUtils]: 130: Hoare triple {39123#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1 else 0)); {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 131: Hoare triple {39123#false} ~cond := #in~cond; {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#false} assume 0 == ~cond; {39123#false} is VALID [2018-11-23 12:01:46,735 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#false} assume !false; {39123#false} is VALID [2018-11-23 12:01:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:46,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:46,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:46,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST