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_copy6_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:59,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:59,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:59,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:59,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:59,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:59,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:59,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:59,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:59,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:59,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:59,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:59,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:59,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:59,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:59,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:59,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:59,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:59,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:59,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:59,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:59,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:59,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:59,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:59,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:59,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:59,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:59,180 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:59,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:59,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:59,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:59,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:59,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:59,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:59,186 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:59,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:59,187 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:59,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:59,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:59,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:59,209 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:59,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:59,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:59,210 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:59,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:59,210 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:59,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:59,211 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:59,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:59,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:59,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:59,214 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:59,214 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:59,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:59,214 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:59,214 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:59,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:59,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:59,215 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:59,215 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:59,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:59,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:59,216 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:59,216 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:59,216 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:59,216 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:59,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:59,217 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:59,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:59,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:59,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:59,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:59,296 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:59,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_true-unreach-call_ground.i [2018-11-23 11:58:59,350 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915339c89/70d72ca137d5492d852ce8febe970b82/FLAG7987166bf [2018-11-23 11:58:59,756 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:59,756 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_true-unreach-call_ground.i [2018-11-23 11:58:59,763 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915339c89/70d72ca137d5492d852ce8febe970b82/FLAG7987166bf [2018-11-23 11:59:00,134 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915339c89/70d72ca137d5492d852ce8febe970b82 [2018-11-23 11:59:00,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:59:00,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:59:00,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:00,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:59:00,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:59:00,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cdcf1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00, skipping insertion in model container [2018-11-23 11:59:00,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:59:00,190 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:59:00,473 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:00,479 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:59:00,528 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:00,560 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:59:00,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00 WrapperNode [2018-11-23 11:59:00,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:00,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:00,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:59:00,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:59:00,572 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:59:00" (1/1) ... [2018-11-23 11:59:00,585 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:59:00" (1/1) ... [2018-11-23 11:59:00,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:00,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:59:00,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:59:00,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:59:00,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (1/1) ... [2018-11-23 11:59:00,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:59:00,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:59:00,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:59:00,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:59:00,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (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:59:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:59:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:59:00,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:59:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:59:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:59:00,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:59:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:59:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:59:00,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:59:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:59:00,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:59:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:59:01,893 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:01,894 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:59:01,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:01 BoogieIcfgContainer [2018-11-23 11:59:01,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:01,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:59:01,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:59:01,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:59:01,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:59:00" (1/3) ... [2018-11-23 11:59:01,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57313876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:01, skipping insertion in model container [2018-11-23 11:59:01,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:00" (2/3) ... [2018-11-23 11:59:01,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57313876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:01, skipping insertion in model container [2018-11-23 11:59:01,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:01" (3/3) ... [2018-11-23 11:59:01,903 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy6_true-unreach-call_ground.i [2018-11-23 11:59:01,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:59:01,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:59:01,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:59:01,979 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:59:01,980 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:59:01,980 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:59:01,981 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:59:01,981 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:59:01,981 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:59:01,981 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:59:01,982 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:59:01,982 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:59:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:59:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:59:02,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:02,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash 772526198, now seen corresponding path program 1 times [2018-11-23 11:59:02,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:59:02,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-23 11:59:02,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:59:02,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #133#return; {45#true} is VALID [2018-11-23 11:59:02,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret17 := main(); {45#true} is VALID [2018-11-23 11:59:02,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {45#true} is VALID [2018-11-23 11:59:02,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 11:59:02,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} havoc ~i~0;~i~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !(~i~0 < 100000); {46#false} is VALID [2018-11-23 11:59:02,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !(~i~0 < 100000); {46#false} is VALID [2018-11-23 11:59:02,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !(~i~0 < 100000); {46#false} is VALID [2018-11-23 11:59:02,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume !(~i~0 < 100000); {46#false} is VALID [2018-11-23 11:59:02,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume !(~i~0 < 100000); {46#false} is VALID [2018-11-23 11:59:02,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-23 11:59:02,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} havoc ~x~0;~x~0 := 0; {46#false} is VALID [2018-11-23 11:59:02,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {46#false} is VALID [2018-11-23 11:59:02,277 INFO L256 TraceCheckUtils]: 21: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {46#false} is VALID [2018-11-23 11:59:02,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 11:59:02,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#false} assume 0 == ~cond; {46#false} is VALID [2018-11-23 11:59:02,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:59:02,283 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:59:02,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:02,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:59:02,291 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 11:59:02,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:02,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:59:02,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:59:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:59:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:59:02,430 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 11:59:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,675 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2018-11-23 11:59:02,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:59:02,676 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 11:59:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 107 transitions. [2018-11-23 11:59:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 107 transitions. [2018-11-23 11:59:02,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 107 transitions. [2018-11-23 11:59:03,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,323 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:59:03,323 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:59:03,330 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:59:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:59:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:59:03,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:03,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:59:03,395 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:59:03,395 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:59:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,400 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 11:59:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:59:03,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,402 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:59:03,402 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:59:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,406 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 11:59:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:59:03,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:03,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:59:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 11:59:03,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2018-11-23 11:59:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,414 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 11:59:03,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:59:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:59:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:59:03,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:03,416 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash 514335338, now seen corresponding path program 1 times [2018-11-23 11:59:03,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2018-11-23 11:59:03,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {273#true} is VALID [2018-11-23 11:59:03,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2018-11-23 11:59:03,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #133#return; {273#true} is VALID [2018-11-23 11:59:03,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret17 := main(); {273#true} is VALID [2018-11-23 11:59:03,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {273#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {275#(= main_~a~0 0)} is VALID [2018-11-23 11:59:03,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {275#(= main_~a~0 0)} assume !(~a~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#false} havoc ~i~0;~i~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#false} assume !(~i~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {274#false} ~i~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {274#false} assume !(~i~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {274#false} ~i~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {274#false} assume !(~i~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {274#false} ~i~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {274#false} assume !(~i~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {274#false} ~i~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {274#false} assume !(~i~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {274#false} ~i~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {274#false} assume !(~i~0 < 100000); {274#false} is VALID [2018-11-23 11:59:03,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {274#false} havoc ~x~0;~x~0 := 0; {274#false} is VALID [2018-11-23 11:59:03,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {274#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {274#false} is VALID [2018-11-23 11:59:03,538 INFO L256 TraceCheckUtils]: 21: Hoare triple {274#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {274#false} is VALID [2018-11-23 11:59:03,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2018-11-23 11:59:03,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2018-11-23 11:59:03,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-11-23 11:59:03,541 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:59:03,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:03,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:03,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:59:03,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:03,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:03,629 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 3 states. [2018-11-23 11:59:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,883 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 11:59:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:03,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:59:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:59:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:59:03,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 11:59:04,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,093 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:59:04,094 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:59:04,097 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:59:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:59:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 11:59:04,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 11:59:04,120 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 11:59:04,121 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 11:59:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,124 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:59:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 11:59:04,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,125 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 11:59:04,126 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 11:59:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,129 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:59:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 11:59:04,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 11:59:04,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2018-11-23 11:59:04,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,133 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 11:59:04,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 11:59:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:59:04,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:04,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1148318088, now seen corresponding path program 1 times [2018-11-23 11:59:04,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {501#true} is VALID [2018-11-23 11:59:04,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {501#true} is VALID [2018-11-23 11:59:04,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2018-11-23 11:59:04,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #133#return; {501#true} is VALID [2018-11-23 11:59:04,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret17 := main(); {501#true} is VALID [2018-11-23 11:59:04,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {501#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {501#true} is VALID [2018-11-23 11:59:04,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {501#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {501#true} is VALID [2018-11-23 11:59:04,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {501#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {501#true} is VALID [2018-11-23 11:59:04,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {501#true} assume !(~a~0 < 100000); {501#true} is VALID [2018-11-23 11:59:04,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {501#true} havoc ~i~0;~i~0 := 0; {503#(= main_~i~0 0)} is VALID [2018-11-23 11:59:04,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {503#(= main_~i~0 0)} assume !(~i~0 < 100000); {502#false} is VALID [2018-11-23 11:59:04,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {502#false} ~i~0 := 0; {502#false} is VALID [2018-11-23 11:59:04,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {502#false} assume !(~i~0 < 100000); {502#false} is VALID [2018-11-23 11:59:04,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {502#false} ~i~0 := 0; {502#false} is VALID [2018-11-23 11:59:04,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(~i~0 < 100000); {502#false} is VALID [2018-11-23 11:59:04,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {502#false} ~i~0 := 0; {502#false} is VALID [2018-11-23 11:59:04,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {502#false} assume !(~i~0 < 100000); {502#false} is VALID [2018-11-23 11:59:04,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {502#false} ~i~0 := 0; {502#false} is VALID [2018-11-23 11:59:04,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {502#false} assume !(~i~0 < 100000); {502#false} is VALID [2018-11-23 11:59:04,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {502#false} ~i~0 := 0; {502#false} is VALID [2018-11-23 11:59:04,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {502#false} assume !(~i~0 < 100000); {502#false} is VALID [2018-11-23 11:59:04,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {502#false} havoc ~x~0;~x~0 := 0; {502#false} is VALID [2018-11-23 11:59:04,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {502#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {502#false} is VALID [2018-11-23 11:59:04,241 INFO L256 TraceCheckUtils]: 23: Hoare triple {502#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {502#false} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {502#false} assume !false; {502#false} is VALID [2018-11-23 11:59:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:59:04,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:04,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:04,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:59:04,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:04,349 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:59:04,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:04,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:04,350 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2018-11-23 11:59:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,651 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 11:59:04,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:04,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:59:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 11:59:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 11:59:04,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-23 11:59:04,877 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:04,880 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:59:04,880 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:59:04,881 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:59:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:59:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-11-23 11:59:04,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 44 states. [2018-11-23 11:59:04,918 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 44 states. [2018-11-23 11:59:04,918 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 44 states. [2018-11-23 11:59:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,922 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 11:59:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 11:59:04,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,923 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 50 states. [2018-11-23 11:59:04,923 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 50 states. [2018-11-23 11:59:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,926 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-23 11:59:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 11:59:04,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 11:59:04,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2018-11-23 11:59:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,931 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 11:59:04,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 11:59:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:59:04,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:04,933 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash 342802812, now seen corresponding path program 1 times [2018-11-23 11:59:04,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2018-11-23 11:59:05,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {776#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {776#true} is VALID [2018-11-23 11:59:05,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2018-11-23 11:59:05,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #133#return; {776#true} is VALID [2018-11-23 11:59:05,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret17 := main(); {776#true} is VALID [2018-11-23 11:59:05,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {776#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {778#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {778#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {778#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {778#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {779#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {779#(<= main_~a~0 1)} assume !(~a~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {777#false} havoc ~i~0;~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {777#false} is VALID [2018-11-23 11:59:05,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {777#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {777#false} is VALID [2018-11-23 11:59:05,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {777#false} is VALID [2018-11-23 11:59:05,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {777#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {777#false} is VALID [2018-11-23 11:59:05,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {777#false} is VALID [2018-11-23 11:59:05,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {777#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {777#false} is VALID [2018-11-23 11:59:05,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {777#false} is VALID [2018-11-23 11:59:05,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {777#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {777#false} is VALID [2018-11-23 11:59:05,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {777#false} is VALID [2018-11-23 11:59:05,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {777#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {777#false} is VALID [2018-11-23 11:59:05,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {777#false} is VALID [2018-11-23 11:59:05,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {777#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {777#false} is VALID [2018-11-23 11:59:05,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {777#false} havoc ~x~0;~x~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {777#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {777#false} is VALID [2018-11-23 11:59:05,095 INFO L256 TraceCheckUtils]: 35: Hoare triple {777#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {777#false} is VALID [2018-11-23 11:59:05,095 INFO L273 TraceCheckUtils]: 36: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2018-11-23 11:59:05,096 INFO L273 TraceCheckUtils]: 37: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2018-11-23 11:59:05,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {777#false} assume !false; {777#false} is VALID [2018-11-23 11:59:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:59:05,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:05,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2018-11-23 11:59:05,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {776#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {776#true} is VALID [2018-11-23 11:59:05,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2018-11-23 11:59:05,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #133#return; {776#true} is VALID [2018-11-23 11:59:05,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret17 := main(); {776#true} is VALID [2018-11-23 11:59:05,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {776#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {798#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:05,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {798#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {798#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:05,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {798#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {779#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {779#(<= main_~a~0 1)} assume !(~a~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {777#false} havoc ~i~0;~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {777#false} is VALID [2018-11-23 11:59:05,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {777#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {777#false} is VALID [2018-11-23 11:59:05,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {777#false} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {777#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {777#false} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {777#false} is VALID [2018-11-23 11:59:05,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {777#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {777#false} is VALID [2018-11-23 11:59:05,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {777#false} is VALID [2018-11-23 11:59:05,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {777#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {777#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {777#false} is VALID [2018-11-23 11:59:05,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {777#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {777#false} is VALID [2018-11-23 11:59:05,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {777#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {777#false} is VALID [2018-11-23 11:59:05,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {777#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {777#false} is VALID [2018-11-23 11:59:05,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {777#false} assume !(~i~0 < 100000); {777#false} is VALID [2018-11-23 11:59:05,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {777#false} havoc ~x~0;~x~0 := 0; {777#false} is VALID [2018-11-23 11:59:05,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {777#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {777#false} is VALID [2018-11-23 11:59:05,503 INFO L256 TraceCheckUtils]: 35: Hoare triple {777#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {777#false} is VALID [2018-11-23 11:59:05,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2018-11-23 11:59:05,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2018-11-23 11:59:05,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {777#false} assume !false; {777#false} is VALID [2018-11-23 11:59:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:59:05,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:59:05,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-23 11:59:05,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:59:05,659 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:59:05,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:05,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:05,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:05,661 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 5 states. [2018-11-23 11:59:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,941 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-23 11:59:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:05,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-23 11:59:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-23 11:59:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-23 11:59:05,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2018-11-23 11:59:06,106 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:06,110 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:59:06,110 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:59:06,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:59:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 11:59:06,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 11:59:06,220 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 11:59:06,220 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 11:59:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,222 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 11:59:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 11:59:06,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,224 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 11:59:06,224 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 11:59:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,226 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 11:59:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 11:59:06,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:59:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-23 11:59:06,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 39 [2018-11-23 11:59:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,231 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-23 11:59:06,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 11:59:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:59:06,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,232 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:06,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash -652688358, now seen corresponding path program 2 times [2018-11-23 11:59:06,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:06,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2018-11-23 11:59:06,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {1178#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1178#true} is VALID [2018-11-23 11:59:06,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2018-11-23 11:59:06,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #133#return; {1178#true} is VALID [2018-11-23 11:59:06,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID [2018-11-23 11:59:06,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {1178#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1180#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {1180#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1180#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {1180#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1181#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {1181#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1181#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {1181#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1182#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {1182#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {1179#false} havoc ~i~0;~i~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1179#false} is VALID [2018-11-23 11:59:06,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1179#false} is VALID [2018-11-23 11:59:06,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#false} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {1179#false} ~i~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {1179#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1179#false} is VALID [2018-11-23 11:59:06,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {1179#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1179#false} is VALID [2018-11-23 11:59:06,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {1179#false} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {1179#false} ~i~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {1179#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1179#false} is VALID [2018-11-23 11:59:06,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {1179#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1179#false} is VALID [2018-11-23 11:59:06,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {1179#false} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {1179#false} ~i~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {1179#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1179#false} is VALID [2018-11-23 11:59:06,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {1179#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1179#false} is VALID [2018-11-23 11:59:06,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {1179#false} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {1179#false} ~i~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {1179#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1179#false} is VALID [2018-11-23 11:59:06,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {1179#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1179#false} is VALID [2018-11-23 11:59:06,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {1179#false} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {1179#false} ~i~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,410 INFO L273 TraceCheckUtils]: 32: Hoare triple {1179#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1179#false} is VALID [2018-11-23 11:59:06,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {1179#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1179#false} is VALID [2018-11-23 11:59:06,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {1179#false} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {1179#false} havoc ~x~0;~x~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {1179#false} is VALID [2018-11-23 11:59:06,412 INFO L256 TraceCheckUtils]: 37: Hoare triple {1179#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {1179#false} is VALID [2018-11-23 11:59:06,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2018-11-23 11:59:06,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {1179#false} assume 0 == ~cond; {1179#false} is VALID [2018-11-23 11:59:06,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2018-11-23 11:59:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:59:06,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:06,416 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:59:06,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:06,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:06,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:06,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2018-11-23 11:59:06,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {1178#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1178#true} is VALID [2018-11-23 11:59:06,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2018-11-23 11:59:06,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #133#return; {1178#true} is VALID [2018-11-23 11:59:06,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID [2018-11-23 11:59:06,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {1178#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1178#true} is VALID [2018-11-23 11:59:06,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {1178#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1178#true} is VALID [2018-11-23 11:59:06,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {1178#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1178#true} is VALID [2018-11-23 11:59:06,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1178#true} is VALID [2018-11-23 11:59:06,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1178#true} is VALID [2018-11-23 11:59:06,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#true} assume !(~a~0 < 100000); {1178#true} is VALID [2018-11-23 11:59:06,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#true} havoc ~i~0;~i~0 := 0; {1178#true} is VALID [2018-11-23 11:59:06,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1178#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1178#true} is VALID [2018-11-23 11:59:06,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {1178#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1178#true} is VALID [2018-11-23 11:59:06,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {1178#true} assume !(~i~0 < 100000); {1178#true} is VALID [2018-11-23 11:59:06,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {1178#true} ~i~0 := 0; {1178#true} is VALID [2018-11-23 11:59:06,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {1178#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1178#true} is VALID [2018-11-23 11:59:06,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {1178#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1178#true} is VALID [2018-11-23 11:59:06,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {1178#true} assume !(~i~0 < 100000); {1178#true} is VALID [2018-11-23 11:59:06,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {1178#true} ~i~0 := 0; {1178#true} is VALID [2018-11-23 11:59:06,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1178#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1178#true} is VALID [2018-11-23 11:59:06,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {1178#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1178#true} is VALID [2018-11-23 11:59:06,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(~i~0 < 100000); {1178#true} is VALID [2018-11-23 11:59:06,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {1178#true} ~i~0 := 0; {1178#true} is VALID [2018-11-23 11:59:06,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {1178#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1178#true} is VALID [2018-11-23 11:59:06,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {1178#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1178#true} is VALID [2018-11-23 11:59:06,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {1178#true} assume !(~i~0 < 100000); {1178#true} is VALID [2018-11-23 11:59:06,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {1178#true} ~i~0 := 0; {1178#true} is VALID [2018-11-23 11:59:06,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {1178#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1178#true} is VALID [2018-11-23 11:59:06,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {1178#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1178#true} is VALID [2018-11-23 11:59:06,619 INFO L273 TraceCheckUtils]: 30: Hoare triple {1178#true} assume !(~i~0 < 100000); {1178#true} is VALID [2018-11-23 11:59:06,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {1178#true} ~i~0 := 0; {1279#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:06,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {1279#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1279#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:06,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {1279#(<= main_~i~0 0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1286#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {1286#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1179#false} is VALID [2018-11-23 11:59:06,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {1179#false} havoc ~x~0;~x~0 := 0; {1179#false} is VALID [2018-11-23 11:59:06,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {1179#false} is VALID [2018-11-23 11:59:06,628 INFO L256 TraceCheckUtils]: 37: Hoare triple {1179#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {1179#false} is VALID [2018-11-23 11:59:06,629 INFO L273 TraceCheckUtils]: 38: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2018-11-23 11:59:06,629 INFO L273 TraceCheckUtils]: 39: Hoare triple {1179#false} assume 0 == ~cond; {1179#false} is VALID [2018-11-23 11:59:06,629 INFO L273 TraceCheckUtils]: 40: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2018-11-23 11:59:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:59:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:59:06,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 11:59:06,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:06,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:59:06,754 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:06,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:59:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:59:06,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:06,755 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-11-23 11:59:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,216 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2018-11-23 11:59:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:07,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 11:59:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2018-11-23 11:59:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2018-11-23 11:59:07,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 116 transitions. [2018-11-23 11:59:07,447 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:07,449 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:59:07,449 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:59:07,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:59:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-11-23 11:59:07,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:07,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 60 states. [2018-11-23 11:59:07,661 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 60 states. [2018-11-23 11:59:07,661 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 60 states. [2018-11-23 11:59:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,664 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-23 11:59:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-11-23 11:59:07,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,665 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 67 states. [2018-11-23 11:59:07,665 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 67 states. [2018-11-23 11:59:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,668 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-23 11:59:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-11-23 11:59:07,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:07,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:59:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-23 11:59:07,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 41 [2018-11-23 11:59:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:07,673 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-23 11:59:07,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:59:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 11:59:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:59:07,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:07,674 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:07,675 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:07,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:07,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1846488876, now seen corresponding path program 3 times [2018-11-23 11:59:07,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:07,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:07,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 11:59:07,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1676#true} is VALID [2018-11-23 11:59:07,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 11:59:07,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #133#return; {1676#true} is VALID [2018-11-23 11:59:07,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret17 := main(); {1676#true} is VALID [2018-11-23 11:59:07,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1678#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1678#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1679#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {1679#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1679#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {1679#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1680#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {1680#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1680#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {1680#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1681#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {1681#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {1677#false} havoc ~i~0;~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1677#false} is VALID [2018-11-23 11:59:07,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {1677#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2018-11-23 11:59:07,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1677#false} is VALID [2018-11-23 11:59:07,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {1677#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2018-11-23 11:59:07,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1677#false} is VALID [2018-11-23 11:59:07,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {1677#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1677#false} is VALID [2018-11-23 11:59:07,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1677#false} is VALID [2018-11-23 11:59:07,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {1677#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1677#false} is VALID [2018-11-23 11:59:07,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1677#false} is VALID [2018-11-23 11:59:07,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {1677#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1677#false} is VALID [2018-11-23 11:59:07,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1677#false} is VALID [2018-11-23 11:59:07,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {1677#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1677#false} is VALID [2018-11-23 11:59:07,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1677#false} is VALID [2018-11-23 11:59:07,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {1677#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1677#false} is VALID [2018-11-23 11:59:07,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1677#false} is VALID [2018-11-23 11:59:07,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {1677#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1677#false} is VALID [2018-11-23 11:59:07,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1677#false} is VALID [2018-11-23 11:59:07,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {1677#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1677#false} is VALID [2018-11-23 11:59:07,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1677#false} is VALID [2018-11-23 11:59:07,846 INFO L273 TraceCheckUtils]: 41: Hoare triple {1677#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1677#false} is VALID [2018-11-23 11:59:07,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1677#false} is VALID [2018-11-23 11:59:07,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {1677#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2018-11-23 11:59:07,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1677#false} is VALID [2018-11-23 11:59:07,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {1677#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2018-11-23 11:59:07,848 INFO L273 TraceCheckUtils]: 48: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:07,848 INFO L273 TraceCheckUtils]: 49: Hoare triple {1677#false} havoc ~x~0;~x~0 := 0; {1677#false} is VALID [2018-11-23 11:59:07,848 INFO L273 TraceCheckUtils]: 50: Hoare triple {1677#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {1677#false} is VALID [2018-11-23 11:59:07,848 INFO L256 TraceCheckUtils]: 51: Hoare triple {1677#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {1677#false} is VALID [2018-11-23 11:59:07,849 INFO L273 TraceCheckUtils]: 52: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2018-11-23 11:59:07,849 INFO L273 TraceCheckUtils]: 53: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2018-11-23 11:59:07,849 INFO L273 TraceCheckUtils]: 54: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 11:59:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 11:59:07,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,853 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:59:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:07,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:59:07,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:08,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 11:59:08,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1676#true} is VALID [2018-11-23 11:59:08,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 11:59:08,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #133#return; {1676#true} is VALID [2018-11-23 11:59:08,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret17 := main(); {1676#true} is VALID [2018-11-23 11:59:08,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1676#true} is VALID [2018-11-23 11:59:08,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {1676#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1676#true} is VALID [2018-11-23 11:59:08,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {1676#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2018-11-23 11:59:08,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {1676#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1676#true} is VALID [2018-11-23 11:59:08,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {1676#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2018-11-23 11:59:08,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {1676#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1676#true} is VALID [2018-11-23 11:59:08,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {1676#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2018-11-23 11:59:08,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {1676#true} assume !(~a~0 < 100000); {1676#true} is VALID [2018-11-23 11:59:08,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {1676#true} havoc ~i~0;~i~0 := 0; {1676#true} is VALID [2018-11-23 11:59:08,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {1676#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1676#true} is VALID [2018-11-23 11:59:08,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {1676#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1676#true} is VALID [2018-11-23 11:59:08,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {1676#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1676#true} is VALID [2018-11-23 11:59:08,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {1676#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1676#true} is VALID [2018-11-23 11:59:08,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {1676#true} assume !(~i~0 < 100000); {1676#true} is VALID [2018-11-23 11:59:08,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {1676#true} ~i~0 := 0; {1676#true} is VALID [2018-11-23 11:59:08,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {1676#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1676#true} is VALID [2018-11-23 11:59:08,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {1676#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1676#true} is VALID [2018-11-23 11:59:08,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {1676#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1676#true} is VALID [2018-11-23 11:59:08,202 INFO L273 TraceCheckUtils]: 23: Hoare triple {1676#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1676#true} is VALID [2018-11-23 11:59:08,202 INFO L273 TraceCheckUtils]: 24: Hoare triple {1676#true} assume !(~i~0 < 100000); {1676#true} is VALID [2018-11-23 11:59:08,202 INFO L273 TraceCheckUtils]: 25: Hoare triple {1676#true} ~i~0 := 0; {1676#true} is VALID [2018-11-23 11:59:08,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {1676#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1676#true} is VALID [2018-11-23 11:59:08,203 INFO L273 TraceCheckUtils]: 27: Hoare triple {1676#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1676#true} is VALID [2018-11-23 11:59:08,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {1676#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1676#true} is VALID [2018-11-23 11:59:08,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {1676#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1676#true} is VALID [2018-11-23 11:59:08,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {1676#true} assume !(~i~0 < 100000); {1676#true} is VALID [2018-11-23 11:59:08,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {1676#true} ~i~0 := 0; {1778#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:08,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {1778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1778#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:08,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {1778#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1785#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:08,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {1785#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1785#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:08,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {1785#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1792#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:08,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {1792#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:08,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:08,211 INFO L273 TraceCheckUtils]: 38: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1677#false} is VALID [2018-11-23 11:59:08,211 INFO L273 TraceCheckUtils]: 39: Hoare triple {1677#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1677#false} is VALID [2018-11-23 11:59:08,211 INFO L273 TraceCheckUtils]: 40: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1677#false} is VALID [2018-11-23 11:59:08,211 INFO L273 TraceCheckUtils]: 41: Hoare triple {1677#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1677#false} is VALID [2018-11-23 11:59:08,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:08,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 11:59:08,212 INFO L273 TraceCheckUtils]: 44: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1677#false} is VALID [2018-11-23 11:59:08,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {1677#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2018-11-23 11:59:08,212 INFO L273 TraceCheckUtils]: 46: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1677#false} is VALID [2018-11-23 11:59:08,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {1677#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {1677#false} havoc ~x~0;~x~0 := 0; {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {1677#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L256 TraceCheckUtils]: 51: Hoare triple {1677#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2018-11-23 11:59:08,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 11:59:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 11:59:08,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:08,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:59:08,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-23 11:59:08,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:08,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:59:08,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:08,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:59:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:59:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:08,312 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 9 states. [2018-11-23 11:59:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,953 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2018-11-23 11:59:08,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:59:08,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-23 11:59:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2018-11-23 11:59:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2018-11-23 11:59:08,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 130 transitions. [2018-11-23 11:59:09,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,213 INFO L225 Difference]: With dead ends: 128 [2018-11-23 11:59:09,213 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:59:09,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:59:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-11-23 11:59:09,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:09,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 74 states. [2018-11-23 11:59:09,273 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 74 states. [2018-11-23 11:59:09,273 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 74 states. [2018-11-23 11:59:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,276 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-11-23 11:59:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-11-23 11:59:09,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,277 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 81 states. [2018-11-23 11:59:09,277 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 81 states. [2018-11-23 11:59:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,280 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-11-23 11:59:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-11-23 11:59:09,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:09,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:59:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-23 11:59:09,284 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 55 [2018-11-23 11:59:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:09,285 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-23 11:59:09,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:59:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-23 11:59:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 11:59:09,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:09,286 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:09,287 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:09,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash -588229954, now seen corresponding path program 4 times [2018-11-23 11:59:09,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:09,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:09,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:09,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {2306#true} call ULTIMATE.init(); {2306#true} is VALID [2018-11-23 11:59:09,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {2306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2306#true} is VALID [2018-11-23 11:59:09,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {2306#true} assume true; {2306#true} is VALID [2018-11-23 11:59:09,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2306#true} {2306#true} #133#return; {2306#true} is VALID [2018-11-23 11:59:09,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {2306#true} call #t~ret17 := main(); {2306#true} is VALID [2018-11-23 11:59:09,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {2306#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2308#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {2308#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2308#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2309#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {2309#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2309#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {2309#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2310#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {2310#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2310#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {2310#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2311#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {2311#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2311#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {2311#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2312#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {2312#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {2307#false} havoc ~i~0;~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2307#false} is VALID [2018-11-23 11:59:09,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {2307#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#false} is VALID [2018-11-23 11:59:09,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2307#false} is VALID [2018-11-23 11:59:09,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {2307#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#false} is VALID [2018-11-23 11:59:09,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2307#false} is VALID [2018-11-23 11:59:09,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {2307#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#false} is VALID [2018-11-23 11:59:09,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2307#false} is VALID [2018-11-23 11:59:09,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {2307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2307#false} is VALID [2018-11-23 11:59:09,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2307#false} is VALID [2018-11-23 11:59:09,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {2307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2307#false} is VALID [2018-11-23 11:59:09,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2307#false} is VALID [2018-11-23 11:59:09,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {2307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2307#false} is VALID [2018-11-23 11:59:09,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2307#false} is VALID [2018-11-23 11:59:09,892 INFO L273 TraceCheckUtils]: 33: Hoare triple {2307#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2307#false} is VALID [2018-11-23 11:59:09,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2307#false} is VALID [2018-11-23 11:59:09,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {2307#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2307#false} is VALID [2018-11-23 11:59:09,893 INFO L273 TraceCheckUtils]: 36: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2307#false} is VALID [2018-11-23 11:59:09,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {2307#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2307#false} is VALID [2018-11-23 11:59:09,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2307#false} is VALID [2018-11-23 11:59:09,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {2307#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2307#false} is VALID [2018-11-23 11:59:09,894 INFO L273 TraceCheckUtils]: 42: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2307#false} is VALID [2018-11-23 11:59:09,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {2307#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2307#false} is VALID [2018-11-23 11:59:09,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2307#false} is VALID [2018-11-23 11:59:09,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {2307#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2307#false} is VALID [2018-11-23 11:59:09,895 INFO L273 TraceCheckUtils]: 46: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2307#false} is VALID [2018-11-23 11:59:09,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {2307#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2307#false} is VALID [2018-11-23 11:59:09,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2307#false} is VALID [2018-11-23 11:59:09,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {2307#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2307#false} is VALID [2018-11-23 11:59:09,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2307#false} is VALID [2018-11-23 11:59:09,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {2307#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2307#false} is VALID [2018-11-23 11:59:09,897 INFO L273 TraceCheckUtils]: 54: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,898 INFO L273 TraceCheckUtils]: 55: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,898 INFO L273 TraceCheckUtils]: 56: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2307#false} is VALID [2018-11-23 11:59:09,898 INFO L273 TraceCheckUtils]: 57: Hoare triple {2307#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2307#false} is VALID [2018-11-23 11:59:09,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2307#false} is VALID [2018-11-23 11:59:09,899 INFO L273 TraceCheckUtils]: 59: Hoare triple {2307#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2307#false} is VALID [2018-11-23 11:59:09,899 INFO L273 TraceCheckUtils]: 60: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2307#false} is VALID [2018-11-23 11:59:09,899 INFO L273 TraceCheckUtils]: 61: Hoare triple {2307#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2307#false} is VALID [2018-11-23 11:59:09,899 INFO L273 TraceCheckUtils]: 62: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:09,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {2307#false} havoc ~x~0;~x~0 := 0; {2307#false} is VALID [2018-11-23 11:59:09,900 INFO L273 TraceCheckUtils]: 64: Hoare triple {2307#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {2307#false} is VALID [2018-11-23 11:59:09,900 INFO L256 TraceCheckUtils]: 65: Hoare triple {2307#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {2307#false} is VALID [2018-11-23 11:59:09,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {2307#false} ~cond := #in~cond; {2307#false} is VALID [2018-11-23 11:59:09,900 INFO L273 TraceCheckUtils]: 67: Hoare triple {2307#false} assume 0 == ~cond; {2307#false} is VALID [2018-11-23 11:59:09,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {2307#false} assume !false; {2307#false} is VALID [2018-11-23 11:59:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-23 11:59:09,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,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 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:59:09,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:09,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:09,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:10,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {2306#true} call ULTIMATE.init(); {2306#true} is VALID [2018-11-23 11:59:10,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {2306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2306#true} is VALID [2018-11-23 11:59:10,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {2306#true} assume true; {2306#true} is VALID [2018-11-23 11:59:10,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2306#true} {2306#true} #133#return; {2306#true} is VALID [2018-11-23 11:59:10,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {2306#true} call #t~ret17 := main(); {2306#true} is VALID [2018-11-23 11:59:10,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {2306#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2331#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:10,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {2331#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2331#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:10,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {2331#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2309#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {2309#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2309#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {2309#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2310#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {2310#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2310#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {2310#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2311#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {2311#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2311#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {2311#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2312#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {2312#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {2307#false} havoc ~i~0;~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2307#false} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {2307#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#false} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2307#false} is VALID [2018-11-23 11:59:10,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {2307#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#false} is VALID [2018-11-23 11:59:10,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2307#false} is VALID [2018-11-23 11:59:10,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {2307#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2307#false} is VALID [2018-11-23 11:59:10,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2307#false} is VALID [2018-11-23 11:59:10,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {2307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2307#false} is VALID [2018-11-23 11:59:10,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2307#false} is VALID [2018-11-23 11:59:10,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {2307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2307#false} is VALID [2018-11-23 11:59:10,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2307#false} is VALID [2018-11-23 11:59:10,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {2307#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2307#false} is VALID [2018-11-23 11:59:10,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {2307#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {2307#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 37: Hoare triple {2307#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 41: Hoare triple {2307#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {2307#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {2307#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2307#false} is VALID [2018-11-23 11:59:10,269 INFO L273 TraceCheckUtils]: 46: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 47: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 48: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {2307#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {2307#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 52: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {2307#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2307#false} is VALID [2018-11-23 11:59:10,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,271 INFO L273 TraceCheckUtils]: 55: Hoare triple {2307#false} ~i~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,271 INFO L273 TraceCheckUtils]: 56: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2307#false} is VALID [2018-11-23 11:59:10,271 INFO L273 TraceCheckUtils]: 57: Hoare triple {2307#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2307#false} is VALID [2018-11-23 11:59:10,271 INFO L273 TraceCheckUtils]: 58: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2307#false} is VALID [2018-11-23 11:59:10,271 INFO L273 TraceCheckUtils]: 59: Hoare triple {2307#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2307#false} is VALID [2018-11-23 11:59:10,271 INFO L273 TraceCheckUtils]: 60: Hoare triple {2307#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2307#false} is VALID [2018-11-23 11:59:10,272 INFO L273 TraceCheckUtils]: 61: Hoare triple {2307#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2307#false} is VALID [2018-11-23 11:59:10,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {2307#false} assume !(~i~0 < 100000); {2307#false} is VALID [2018-11-23 11:59:10,272 INFO L273 TraceCheckUtils]: 63: Hoare triple {2307#false} havoc ~x~0;~x~0 := 0; {2307#false} is VALID [2018-11-23 11:59:10,272 INFO L273 TraceCheckUtils]: 64: Hoare triple {2307#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {2307#false} is VALID [2018-11-23 11:59:10,272 INFO L256 TraceCheckUtils]: 65: Hoare triple {2307#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {2307#false} is VALID [2018-11-23 11:59:10,272 INFO L273 TraceCheckUtils]: 66: Hoare triple {2307#false} ~cond := #in~cond; {2307#false} is VALID [2018-11-23 11:59:10,273 INFO L273 TraceCheckUtils]: 67: Hoare triple {2307#false} assume 0 == ~cond; {2307#false} is VALID [2018-11-23 11:59:10,273 INFO L273 TraceCheckUtils]: 68: Hoare triple {2307#false} assume !false; {2307#false} is VALID [2018-11-23 11:59:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-23 11:59:10,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:10,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:59:10,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-11-23 11:59:10,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:10,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:59:10,375 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:59:10,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:10,377 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 8 states. [2018-11-23 11:59:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,964 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 11:59:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:10,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-11-23 11:59:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:59:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:59:10,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2018-11-23 11:59:11,075 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:11,077 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:59:11,077 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:59:11,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:59:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-11-23 11:59:11,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:11,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2018-11-23 11:59:11,125 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2018-11-23 11:59:11,125 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2018-11-23 11:59:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,128 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-23 11:59:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-23 11:59:11,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,129 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2018-11-23 11:59:11,129 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2018-11-23 11:59:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,131 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-23 11:59:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-23 11:59:11,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:11,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:59:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-11-23 11:59:11,134 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 69 [2018-11-23 11:59:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:11,135 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-11-23 11:59:11,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-23 11:59:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:59:11,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:11,136 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:11,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:11,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1431727324, now seen corresponding path program 5 times [2018-11-23 11:59:11,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {2987#true} call ULTIMATE.init(); {2987#true} is VALID [2018-11-23 11:59:11,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {2987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2987#true} is VALID [2018-11-23 11:59:11,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {2987#true} assume true; {2987#true} is VALID [2018-11-23 11:59:11,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2987#true} {2987#true} #133#return; {2987#true} is VALID [2018-11-23 11:59:11,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {2987#true} call #t~ret17 := main(); {2987#true} is VALID [2018-11-23 11:59:11,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {2987#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2989#(= main_~a~0 0)} is VALID [2018-11-23 11:59:11,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {2989#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2989#(= main_~a~0 0)} is VALID [2018-11-23 11:59:11,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {2989#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2990#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {2990#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2990#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {2990#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2991#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {2991#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2991#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {2991#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2992#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {2992#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2992#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {2992#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2993#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:11,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {2993#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2993#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:11,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {2993#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2994#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:11,412 INFO L273 TraceCheckUtils]: 16: Hoare triple {2994#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {2988#false} havoc ~i~0;~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2988#false} is VALID [2018-11-23 11:59:11,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {2988#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2988#false} is VALID [2018-11-23 11:59:11,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2988#false} is VALID [2018-11-23 11:59:11,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {2988#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2988#false} is VALID [2018-11-23 11:59:11,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2988#false} is VALID [2018-11-23 11:59:11,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {2988#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2988#false} is VALID [2018-11-23 11:59:11,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2988#false} is VALID [2018-11-23 11:59:11,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {2988#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2988#false} is VALID [2018-11-23 11:59:11,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2988#false} is VALID [2018-11-23 11:59:11,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {2988#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2988#false} is VALID [2018-11-23 11:59:11,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2988#false} is VALID [2018-11-23 11:59:11,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {2988#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2988#false} is VALID [2018-11-23 11:59:11,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2988#false} is VALID [2018-11-23 11:59:11,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {2988#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2988#false} is VALID [2018-11-23 11:59:11,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2988#false} is VALID [2018-11-23 11:59:11,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {2988#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2988#false} is VALID [2018-11-23 11:59:11,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2988#false} is VALID [2018-11-23 11:59:11,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {2988#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2988#false} is VALID [2018-11-23 11:59:11,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2988#false} is VALID [2018-11-23 11:59:11,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {2988#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2988#false} is VALID [2018-11-23 11:59:11,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2988#false} is VALID [2018-11-23 11:59:11,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {2988#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2988#false} is VALID [2018-11-23 11:59:11,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2988#false} is VALID [2018-11-23 11:59:11,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {2988#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2988#false} is VALID [2018-11-23 11:59:11,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2988#false} is VALID [2018-11-23 11:59:11,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {2988#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2988#false} is VALID [2018-11-23 11:59:11,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2988#false} is VALID [2018-11-23 11:59:11,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {2988#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2988#false} is VALID [2018-11-23 11:59:11,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2988#false} is VALID [2018-11-23 11:59:11,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {2988#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2988#false} is VALID [2018-11-23 11:59:11,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2988#false} is VALID [2018-11-23 11:59:11,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {2988#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2988#false} is VALID [2018-11-23 11:59:11,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2988#false} is VALID [2018-11-23 11:59:11,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {2988#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2988#false} is VALID [2018-11-23 11:59:11,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2988#false} is VALID [2018-11-23 11:59:11,422 INFO L273 TraceCheckUtils]: 63: Hoare triple {2988#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2988#false} is VALID [2018-11-23 11:59:11,422 INFO L273 TraceCheckUtils]: 64: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:11,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {2988#false} havoc ~x~0;~x~0 := 0; {2988#false} is VALID [2018-11-23 11:59:11,422 INFO L273 TraceCheckUtils]: 66: Hoare triple {2988#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {2988#false} is VALID [2018-11-23 11:59:11,422 INFO L256 TraceCheckUtils]: 67: Hoare triple {2988#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {2988#false} is VALID [2018-11-23 11:59:11,423 INFO L273 TraceCheckUtils]: 68: Hoare triple {2988#false} ~cond := #in~cond; {2988#false} is VALID [2018-11-23 11:59:11,423 INFO L273 TraceCheckUtils]: 69: Hoare triple {2988#false} assume 0 == ~cond; {2988#false} is VALID [2018-11-23 11:59:11,423 INFO L273 TraceCheckUtils]: 70: Hoare triple {2988#false} assume !false; {2988#false} is VALID [2018-11-23 11:59:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-23 11:59:11,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:11,426 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:59:11,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:16,759 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:16,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:16,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {2987#true} call ULTIMATE.init(); {2987#true} is VALID [2018-11-23 11:59:16,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {2987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2987#true} is VALID [2018-11-23 11:59:16,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {2987#true} assume true; {2987#true} is VALID [2018-11-23 11:59:16,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2987#true} {2987#true} #133#return; {2987#true} is VALID [2018-11-23 11:59:16,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {2987#true} call #t~ret17 := main(); {2987#true} is VALID [2018-11-23 11:59:16,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {2987#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2987#true} is VALID [2018-11-23 11:59:16,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {2987#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2987#true} is VALID [2018-11-23 11:59:16,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {2987#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#true} is VALID [2018-11-23 11:59:16,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {2987#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2987#true} is VALID [2018-11-23 11:59:16,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {2987#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#true} is VALID [2018-11-23 11:59:16,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {2987#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2987#true} is VALID [2018-11-23 11:59:16,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {2987#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {2987#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {2987#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {2987#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {2987#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {2987#true} assume !(~a~0 < 100000); {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {2987#true} havoc ~i~0;~i~0 := 0; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {2987#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#true} is VALID [2018-11-23 11:59:16,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {2987#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {2987#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {2987#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {2987#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {2987#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {2987#true} assume !(~i~0 < 100000); {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {2987#true} ~i~0 := 0; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {2987#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#true} is VALID [2018-11-23 11:59:16,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {2987#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#true} is VALID [2018-11-23 11:59:16,929 INFO L273 TraceCheckUtils]: 28: Hoare triple {2987#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#true} is VALID [2018-11-23 11:59:16,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {2987#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#true} is VALID [2018-11-23 11:59:16,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {2987#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2987#true} is VALID [2018-11-23 11:59:16,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {2987#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2987#true} is VALID [2018-11-23 11:59:16,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {2987#true} assume !(~i~0 < 100000); {2987#true} is VALID [2018-11-23 11:59:16,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {2987#true} ~i~0 := 0; {3097#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3097#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3104#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {3104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3104#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,931 INFO L273 TraceCheckUtils]: 37: Hoare triple {3104#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3111#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3111#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,932 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3118#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,933 INFO L273 TraceCheckUtils]: 40: Hoare triple {3118#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:16,933 INFO L273 TraceCheckUtils]: 41: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:16,933 INFO L273 TraceCheckUtils]: 42: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2988#false} is VALID [2018-11-23 11:59:16,933 INFO L273 TraceCheckUtils]: 43: Hoare triple {2988#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2988#false} is VALID [2018-11-23 11:59:16,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2988#false} is VALID [2018-11-23 11:59:16,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {2988#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2988#false} is VALID [2018-11-23 11:59:16,934 INFO L273 TraceCheckUtils]: 46: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2988#false} is VALID [2018-11-23 11:59:16,934 INFO L273 TraceCheckUtils]: 47: Hoare triple {2988#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2988#false} is VALID [2018-11-23 11:59:16,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:16,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:16,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2988#false} is VALID [2018-11-23 11:59:16,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {2988#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2988#false} is VALID [2018-11-23 11:59:16,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2988#false} is VALID [2018-11-23 11:59:16,935 INFO L273 TraceCheckUtils]: 53: Hoare triple {2988#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 54: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 55: Hoare triple {2988#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 56: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 57: Hoare triple {2988#false} ~i~0 := 0; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 58: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 59: Hoare triple {2988#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 60: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2988#false} is VALID [2018-11-23 11:59:16,936 INFO L273 TraceCheckUtils]: 61: Hoare triple {2988#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 62: Hoare triple {2988#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 63: Hoare triple {2988#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {2988#false} assume !(~i~0 < 100000); {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {2988#false} havoc ~x~0;~x~0 := 0; {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {2988#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L256 TraceCheckUtils]: 67: Hoare triple {2988#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 68: Hoare triple {2988#false} ~cond := #in~cond; {2988#false} is VALID [2018-11-23 11:59:16,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {2988#false} assume 0 == ~cond; {2988#false} is VALID [2018-11-23 11:59:16,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {2988#false} assume !false; {2988#false} is VALID [2018-11-23 11:59:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:59:16,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:59:16,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 11:59:16,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:16,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:17,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:17,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:17,081 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 12 states. [2018-11-23 11:59:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,939 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-11-23 11:59:17,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:59:17,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 11:59:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2018-11-23 11:59:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2018-11-23 11:59:17,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 146 transitions. [2018-11-23 11:59:18,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:18,278 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:59:18,279 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 11:59:18,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 11:59:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-11-23 11:59:18,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:18,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 90 states. [2018-11-23 11:59:18,380 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 90 states. [2018-11-23 11:59:18,380 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 90 states. [2018-11-23 11:59:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,383 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-11-23 11:59:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-23 11:59:18,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:18,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:18,384 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 97 states. [2018-11-23 11:59:18,384 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 97 states. [2018-11-23 11:59:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,388 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-11-23 11:59:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-11-23 11:59:18,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:18,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:18,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:18,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:59:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-11-23 11:59:18,392 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 71 [2018-11-23 11:59:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:18,392 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-11-23 11:59:18,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-23 11:59:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:59:18,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:18,393 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:18,394 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:18,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash 868637806, now seen corresponding path program 6 times [2018-11-23 11:59:18,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:18,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:18,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {3766#true} call ULTIMATE.init(); {3766#true} is VALID [2018-11-23 11:59:18,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {3766#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3766#true} is VALID [2018-11-23 11:59:18,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {3766#true} assume true; {3766#true} is VALID [2018-11-23 11:59:18,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3766#true} {3766#true} #133#return; {3766#true} is VALID [2018-11-23 11:59:18,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {3766#true} call #t~ret17 := main(); {3766#true} is VALID [2018-11-23 11:59:18,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {3766#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3768#(= main_~a~0 0)} is VALID [2018-11-23 11:59:18,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {3768#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3768#(= main_~a~0 0)} is VALID [2018-11-23 11:59:18,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {3768#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:18,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {3769#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3769#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:18,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {3769#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:18,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {3770#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3770#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:18,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {3770#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:18,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {3771#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3771#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:18,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {3771#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:18,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {3772#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3772#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:18,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {3772#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:18,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {3773#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3773#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:18,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {3773#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {3774#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {3767#false} havoc ~i~0;~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3767#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {3767#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3767#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3767#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {3767#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3767#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3767#false} is VALID [2018-11-23 11:59:18,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {3767#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3767#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3767#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {3767#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3767#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {3767#false} ~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {3767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {3767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {3767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3767#false} is VALID [2018-11-23 11:59:18,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {3767#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3767#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {3767#false} ~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3767#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {3767#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3767#false} is VALID [2018-11-23 11:59:18,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3767#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {3767#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3767#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3767#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {3767#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3767#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3767#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {3767#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3767#false} is VALID [2018-11-23 11:59:18,615 INFO L273 TraceCheckUtils]: 48: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {3767#false} ~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3767#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {3767#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3767#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3767#false} is VALID [2018-11-23 11:59:18,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {3767#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3767#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 54: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3767#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {3767#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3767#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3767#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {3767#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3767#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {3767#false} ~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 60: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3767#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 61: Hoare triple {3767#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3767#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 62: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3767#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 63: Hoare triple {3767#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3767#false} is VALID [2018-11-23 11:59:18,618 INFO L273 TraceCheckUtils]: 64: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3767#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 65: Hoare triple {3767#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3767#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 66: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3767#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 67: Hoare triple {3767#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3767#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 68: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {3767#false} ~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 71: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 72: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 73: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 74: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 75: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:18,620 INFO L273 TraceCheckUtils]: 76: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:18,621 INFO L273 TraceCheckUtils]: 77: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:18,621 INFO L273 TraceCheckUtils]: 78: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:18,621 INFO L273 TraceCheckUtils]: 79: Hoare triple {3767#false} havoc ~x~0;~x~0 := 0; {3767#false} is VALID [2018-11-23 11:59:18,621 INFO L273 TraceCheckUtils]: 80: Hoare triple {3767#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {3767#false} is VALID [2018-11-23 11:59:18,621 INFO L256 TraceCheckUtils]: 81: Hoare triple {3767#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {3767#false} is VALID [2018-11-23 11:59:18,622 INFO L273 TraceCheckUtils]: 82: Hoare triple {3767#false} ~cond := #in~cond; {3767#false} is VALID [2018-11-23 11:59:18,622 INFO L273 TraceCheckUtils]: 83: Hoare triple {3767#false} assume 0 == ~cond; {3767#false} is VALID [2018-11-23 11:59:18,622 INFO L273 TraceCheckUtils]: 84: Hoare triple {3767#false} assume !false; {3767#false} is VALID [2018-11-23 11:59:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-23 11:59:18,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:18,626 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:59:18,642 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:19,203 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:19,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:19,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {3766#true} call ULTIMATE.init(); {3766#true} is VALID [2018-11-23 11:59:19,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {3766#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3766#true} is VALID [2018-11-23 11:59:19,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {3766#true} assume true; {3766#true} is VALID [2018-11-23 11:59:19,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3766#true} {3766#true} #133#return; {3766#true} is VALID [2018-11-23 11:59:19,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {3766#true} call #t~ret17 := main(); {3766#true} is VALID [2018-11-23 11:59:19,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {3766#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3766#true} is VALID [2018-11-23 11:59:19,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {3766#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3766#true} is VALID [2018-11-23 11:59:19,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {3766#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3766#true} is VALID [2018-11-23 11:59:19,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {3766#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {3766#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {3766#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {3766#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {3766#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {3766#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3766#true} is VALID [2018-11-23 11:59:19,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {3766#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {3766#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {3766#true} assume !(~a~0 < 100000); {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {3766#true} havoc ~i~0;~i~0 := 0; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {3766#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 22: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {3766#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3766#true} is VALID [2018-11-23 11:59:19,693 INFO L273 TraceCheckUtils]: 24: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 25: Hoare triple {3766#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#true} assume !(~i~0 < 100000); {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {3766#true} ~i~0 := 0; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {3766#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3766#true} is VALID [2018-11-23 11:59:19,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {3766#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {3766#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {3766#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {3766#true} assume !(~i~0 < 100000); {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {3766#true} ~i~0 := 0; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3766#true} is VALID [2018-11-23 11:59:19,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {3766#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {3766#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 45: Hoare triple {3766#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 47: Hoare triple {3766#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {3766#true} assume !(~i~0 < 100000); {3766#true} is VALID [2018-11-23 11:59:19,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {3766#true} ~i~0 := 0; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {3766#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 52: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 53: Hoare triple {3766#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 54: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 55: Hoare triple {3766#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 56: Hoare triple {3766#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3766#true} is VALID [2018-11-23 11:59:19,697 INFO L273 TraceCheckUtils]: 57: Hoare triple {3766#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3766#true} is VALID [2018-11-23 11:59:19,698 INFO L273 TraceCheckUtils]: 58: Hoare triple {3766#true} assume !(~i~0 < 100000); {3766#true} is VALID [2018-11-23 11:59:19,698 INFO L273 TraceCheckUtils]: 59: Hoare triple {3766#true} ~i~0 := 0; {3955#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:19,698 INFO L273 TraceCheckUtils]: 60: Hoare triple {3955#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3955#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:19,699 INFO L273 TraceCheckUtils]: 61: Hoare triple {3955#(<= main_~i~0 0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3962#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:19,699 INFO L273 TraceCheckUtils]: 62: Hoare triple {3962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3962#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:19,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {3962#(<= main_~i~0 1)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3969#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:19,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {3969#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3969#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:19,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {3969#(<= main_~i~0 2)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3976#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:19,727 INFO L273 TraceCheckUtils]: 66: Hoare triple {3976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3976#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:19,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {3976#(<= main_~i~0 3)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3983#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:19,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {3983#(<= main_~i~0 4)} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:19,750 INFO L273 TraceCheckUtils]: 69: Hoare triple {3767#false} ~i~0 := 0; {3767#false} is VALID [2018-11-23 11:59:19,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:19,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:19,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:19,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:19,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:19,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:19,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {3767#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3767#false} is VALID [2018-11-23 11:59:19,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {3767#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3767#false} is VALID [2018-11-23 11:59:19,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {3767#false} assume !(~i~0 < 100000); {3767#false} is VALID [2018-11-23 11:59:19,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {3767#false} havoc ~x~0;~x~0 := 0; {3767#false} is VALID [2018-11-23 11:59:19,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {3767#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {3767#false} is VALID [2018-11-23 11:59:19,752 INFO L256 TraceCheckUtils]: 81: Hoare triple {3767#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {3767#false} is VALID [2018-11-23 11:59:19,752 INFO L273 TraceCheckUtils]: 82: Hoare triple {3767#false} ~cond := #in~cond; {3767#false} is VALID [2018-11-23 11:59:19,753 INFO L273 TraceCheckUtils]: 83: Hoare triple {3767#false} assume 0 == ~cond; {3767#false} is VALID [2018-11-23 11:59:19,753 INFO L273 TraceCheckUtils]: 84: Hoare triple {3767#false} assume !false; {3767#false} is VALID [2018-11-23 11:59:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 11:59:19,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:19,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:59:19,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-11-23 11:59:19,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:19,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:19,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:19,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:19,886 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 14 states. [2018-11-23 11:59:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,679 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-11-23 11:59:20,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:59:20,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-11-23 11:59:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 160 transitions. [2018-11-23 11:59:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 160 transitions. [2018-11-23 11:59:20,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 160 transitions. [2018-11-23 11:59:20,839 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:20,841 INFO L225 Difference]: With dead ends: 182 [2018-11-23 11:59:20,841 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:59:20,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:59:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-11-23 11:59:20,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:20,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 104 states. [2018-11-23 11:59:20,889 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 104 states. [2018-11-23 11:59:20,889 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 104 states. [2018-11-23 11:59:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,894 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-11-23 11:59:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-11-23 11:59:20,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,894 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 111 states. [2018-11-23 11:59:20,895 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 111 states. [2018-11-23 11:59:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,898 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-11-23 11:59:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-11-23 11:59:20,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:20,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:59:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-11-23 11:59:20,902 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 85 [2018-11-23 11:59:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:20,903 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-11-23 11:59:20,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-11-23 11:59:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:59:20,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:20,904 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:20,905 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -419486592, now seen corresponding path program 7 times [2018-11-23 11:59:20,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4677#true} is VALID [2018-11-23 11:59:22,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {4677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4677#true} is VALID [2018-11-23 11:59:22,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {4677#true} assume true; {4677#true} is VALID [2018-11-23 11:59:22,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4677#true} {4677#true} #133#return; {4677#true} is VALID [2018-11-23 11:59:22,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {4677#true} call #t~ret17 := main(); {4677#true} is VALID [2018-11-23 11:59:22,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {4677#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4679#(= main_~a~0 0)} is VALID [2018-11-23 11:59:22,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {4679#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4679#(= main_~a~0 0)} is VALID [2018-11-23 11:59:22,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {4679#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4680#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:22,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {4680#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4680#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:22,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {4680#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4681#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:22,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {4681#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4681#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:22,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {4681#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4682#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:22,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {4682#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4682#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:22,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {4682#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4683#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:22,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {4683#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4683#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:22,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {4683#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4684#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:22,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {4684#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4684#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:22,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {4684#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4685#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:22,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {4685#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4685#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:22,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {4685#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4686#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:22,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {4686#(<= main_~a~0 7)} assume !(~a~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {4678#false} havoc ~i~0;~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,085 INFO L273 TraceCheckUtils]: 34: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,085 INFO L273 TraceCheckUtils]: 35: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 36: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 37: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 38: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 39: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 40: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 41: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 45: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 46: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 47: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 48: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 51: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 54: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 55: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 56: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 57: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 58: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 59: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,088 INFO L273 TraceCheckUtils]: 61: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 63: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 64: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 65: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 66: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 67: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 68: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,089 INFO L273 TraceCheckUtils]: 69: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 70: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 71: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 72: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 73: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 74: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 75: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 76: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,090 INFO L273 TraceCheckUtils]: 77: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 78: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 79: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 80: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 81: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 82: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 83: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 84: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 85: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,091 INFO L273 TraceCheckUtils]: 86: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 87: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 88: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 89: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 90: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 91: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 92: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,092 INFO L273 TraceCheckUtils]: 93: Hoare triple {4678#false} havoc ~x~0;~x~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,093 INFO L273 TraceCheckUtils]: 94: Hoare triple {4678#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {4678#false} is VALID [2018-11-23 11:59:22,093 INFO L256 TraceCheckUtils]: 95: Hoare triple {4678#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {4678#false} is VALID [2018-11-23 11:59:22,093 INFO L273 TraceCheckUtils]: 96: Hoare triple {4678#false} ~cond := #in~cond; {4678#false} is VALID [2018-11-23 11:59:22,093 INFO L273 TraceCheckUtils]: 97: Hoare triple {4678#false} assume 0 == ~cond; {4678#false} is VALID [2018-11-23 11:59:22,093 INFO L273 TraceCheckUtils]: 98: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2018-11-23 11:59:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 11:59:22,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:22,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:22,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:22,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4677#true} is VALID [2018-11-23 11:59:22,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {4677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4677#true} is VALID [2018-11-23 11:59:22,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {4677#true} assume true; {4677#true} is VALID [2018-11-23 11:59:22,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4677#true} {4677#true} #133#return; {4677#true} is VALID [2018-11-23 11:59:22,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {4677#true} call #t~ret17 := main(); {4677#true} is VALID [2018-11-23 11:59:22,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {4677#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4705#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:22,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {4705#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4705#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:22,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {4705#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4680#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:22,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {4680#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4680#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:22,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {4680#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4681#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:22,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {4681#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4681#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:22,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {4681#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4682#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:22,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {4682#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4682#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:22,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {4682#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4683#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:22,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {4683#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4683#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:22,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {4683#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4684#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:22,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {4684#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4684#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:22,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {4684#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4685#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:22,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {4685#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4685#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:22,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {4685#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4686#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:22,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {4686#(<= main_~a~0 7)} assume !(~a~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {4678#false} havoc ~i~0;~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4678#false} is VALID [2018-11-23 11:59:22,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {4678#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4678#false} is VALID [2018-11-23 11:59:22,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,361 INFO L273 TraceCheckUtils]: 35: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,361 INFO L273 TraceCheckUtils]: 37: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,361 INFO L273 TraceCheckUtils]: 38: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,362 INFO L273 TraceCheckUtils]: 40: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4678#false} is VALID [2018-11-23 11:59:22,362 INFO L273 TraceCheckUtils]: 43: Hoare triple {4678#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4678#false} is VALID [2018-11-23 11:59:22,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4678#false} is VALID [2018-11-23 11:59:22,364 INFO L273 TraceCheckUtils]: 55: Hoare triple {4678#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4678#false} is VALID [2018-11-23 11:59:22,364 INFO L273 TraceCheckUtils]: 56: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,364 INFO L273 TraceCheckUtils]: 57: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 58: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 59: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 60: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 61: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 62: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 63: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,365 INFO L273 TraceCheckUtils]: 64: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 65: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 66: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {4678#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 70: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,366 INFO L273 TraceCheckUtils]: 71: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,367 INFO L273 TraceCheckUtils]: 72: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,367 INFO L273 TraceCheckUtils]: 73: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,367 INFO L273 TraceCheckUtils]: 74: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,367 INFO L273 TraceCheckUtils]: 75: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,367 INFO L273 TraceCheckUtils]: 76: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,367 INFO L273 TraceCheckUtils]: 77: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,368 INFO L273 TraceCheckUtils]: 78: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4678#false} is VALID [2018-11-23 11:59:22,368 INFO L273 TraceCheckUtils]: 79: Hoare triple {4678#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4678#false} is VALID [2018-11-23 11:59:22,368 INFO L273 TraceCheckUtils]: 80: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,368 INFO L273 TraceCheckUtils]: 81: Hoare triple {4678#false} ~i~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,368 INFO L273 TraceCheckUtils]: 82: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,369 INFO L273 TraceCheckUtils]: 83: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,369 INFO L273 TraceCheckUtils]: 84: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,369 INFO L273 TraceCheckUtils]: 85: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,369 INFO L273 TraceCheckUtils]: 86: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,369 INFO L273 TraceCheckUtils]: 87: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,369 INFO L273 TraceCheckUtils]: 88: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L273 TraceCheckUtils]: 89: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L273 TraceCheckUtils]: 90: Hoare triple {4678#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L273 TraceCheckUtils]: 91: Hoare triple {4678#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L273 TraceCheckUtils]: 92: Hoare triple {4678#false} assume !(~i~0 < 100000); {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L273 TraceCheckUtils]: 93: Hoare triple {4678#false} havoc ~x~0;~x~0 := 0; {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L273 TraceCheckUtils]: 94: Hoare triple {4678#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {4678#false} is VALID [2018-11-23 11:59:22,370 INFO L256 TraceCheckUtils]: 95: Hoare triple {4678#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {4678#false} is VALID [2018-11-23 11:59:22,371 INFO L273 TraceCheckUtils]: 96: Hoare triple {4678#false} ~cond := #in~cond; {4678#false} is VALID [2018-11-23 11:59:22,371 INFO L273 TraceCheckUtils]: 97: Hoare triple {4678#false} assume 0 == ~cond; {4678#false} is VALID [2018-11-23 11:59:22,371 INFO L273 TraceCheckUtils]: 98: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2018-11-23 11:59:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 11:59:22,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:22,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:22,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-11-23 11:59:22,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:22,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:22,462 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:59:22,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:22,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:22,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:22,463 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 11 states. [2018-11-23 11:59:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:22,949 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2018-11-23 11:59:22,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:22,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-11-23 11:59:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2018-11-23 11:59:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2018-11-23 11:59:22,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2018-11-23 11:59:23,078 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:23,083 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:59:23,083 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:59:23,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:59:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-11-23 11:59:23,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:23,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 106 states. [2018-11-23 11:59:23,139 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 106 states. [2018-11-23 11:59:23,139 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 106 states. [2018-11-23 11:59:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:23,143 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-11-23 11:59:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 11:59:23,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:23,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:23,143 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 107 states. [2018-11-23 11:59:23,144 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 107 states. [2018-11-23 11:59:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:23,148 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-11-23 11:59:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 11:59:23,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:23,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:23,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:23,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:59:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-11-23 11:59:23,152 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 99 [2018-11-23 11:59:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:23,152 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-11-23 11:59:23,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-11-23 11:59:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 11:59:23,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:23,154 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:23,154 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:23,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1082340894, now seen corresponding path program 8 times [2018-11-23 11:59:23,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:23,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2018-11-23 11:59:23,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5637#true} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {5637#true} assume true; {5637#true} is VALID [2018-11-23 11:59:23,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5637#true} {5637#true} #133#return; {5637#true} is VALID [2018-11-23 11:59:23,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {5637#true} call #t~ret17 := main(); {5637#true} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {5637#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5639#(= main_~a~0 0)} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {5639#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5639#(= main_~a~0 0)} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {5639#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5640#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {5640#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5640#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {5640#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5641#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {5641#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5641#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {5641#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5642#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {5642#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5642#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {5642#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5643#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {5643#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5643#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {5643#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5644#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {5644#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5644#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {5644#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5645#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {5645#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5645#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {5645#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5646#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {5646#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5646#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {5646#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5647#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:23,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {5647#(<= main_~a~0 8)} assume !(~a~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {5638#false} havoc ~i~0;~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,562 INFO L273 TraceCheckUtils]: 28: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,564 INFO L273 TraceCheckUtils]: 37: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,566 INFO L273 TraceCheckUtils]: 54: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,567 INFO L273 TraceCheckUtils]: 55: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,567 INFO L273 TraceCheckUtils]: 56: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 61: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 62: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 63: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 64: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 68: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 69: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 70: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 71: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 72: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 73: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,570 INFO L273 TraceCheckUtils]: 75: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,570 INFO L273 TraceCheckUtils]: 76: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,570 INFO L273 TraceCheckUtils]: 77: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,570 INFO L273 TraceCheckUtils]: 78: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,570 INFO L273 TraceCheckUtils]: 79: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,570 INFO L273 TraceCheckUtils]: 80: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 81: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 82: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 83: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 84: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 85: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 86: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,571 INFO L273 TraceCheckUtils]: 87: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,572 INFO L273 TraceCheckUtils]: 88: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,572 INFO L273 TraceCheckUtils]: 89: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,572 INFO L273 TraceCheckUtils]: 90: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,572 INFO L273 TraceCheckUtils]: 91: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,572 INFO L273 TraceCheckUtils]: 92: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,572 INFO L273 TraceCheckUtils]: 93: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L273 TraceCheckUtils]: 94: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L273 TraceCheckUtils]: 95: Hoare triple {5638#false} havoc ~x~0;~x~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L273 TraceCheckUtils]: 96: Hoare triple {5638#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L256 TraceCheckUtils]: 97: Hoare triple {5638#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L273 TraceCheckUtils]: 98: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L273 TraceCheckUtils]: 99: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2018-11-23 11:59:23,573 INFO L273 TraceCheckUtils]: 100: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2018-11-23 11:59:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 11:59:23,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:23,584 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:59:23,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:23,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:23,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:23,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2018-11-23 11:59:23,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5637#true} is VALID [2018-11-23 11:59:23,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {5637#true} assume true; {5637#true} is VALID [2018-11-23 11:59:23,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5637#true} {5637#true} #133#return; {5637#true} is VALID [2018-11-23 11:59:23,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {5637#true} call #t~ret17 := main(); {5637#true} is VALID [2018-11-23 11:59:23,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {5637#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5666#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:23,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {5666#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5666#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:23,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {5666#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5640#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {5640#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5640#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {5640#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5641#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {5641#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5641#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {5641#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5642#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {5642#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5642#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {5642#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5643#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {5643#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5643#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {5643#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5644#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {5644#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5644#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {5644#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5645#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {5645#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5645#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {5645#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5646#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {5646#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5646#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,821 INFO L273 TraceCheckUtils]: 21: Hoare triple {5646#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5647#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:23,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {5647#(<= main_~a~0 8)} assume !(~a~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {5638#false} havoc ~i~0;~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,823 INFO L273 TraceCheckUtils]: 32: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5638#false} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {5638#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#false} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 36: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 39: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 40: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {5638#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5638#false} is VALID [2018-11-23 11:59:23,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,826 INFO L273 TraceCheckUtils]: 54: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 55: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {5638#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 59: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 61: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 62: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,827 INFO L273 TraceCheckUtils]: 63: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 64: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 65: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 66: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 67: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 68: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 69: Hoare triple {5638#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 70: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,828 INFO L273 TraceCheckUtils]: 71: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 72: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 73: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 74: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 75: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 76: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 77: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 78: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 79: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,829 INFO L273 TraceCheckUtils]: 80: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 81: Hoare triple {5638#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 82: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 83: Hoare triple {5638#false} ~i~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 84: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 85: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 86: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 87: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 88: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,830 INFO L273 TraceCheckUtils]: 89: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 90: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 91: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 92: Hoare triple {5638#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 93: Hoare triple {5638#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 94: Hoare triple {5638#false} assume !(~i~0 < 100000); {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 95: Hoare triple {5638#false} havoc ~x~0;~x~0 := 0; {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L273 TraceCheckUtils]: 96: Hoare triple {5638#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {5638#false} is VALID [2018-11-23 11:59:23,831 INFO L256 TraceCheckUtils]: 97: Hoare triple {5638#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {5638#false} is VALID [2018-11-23 11:59:23,832 INFO L273 TraceCheckUtils]: 98: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2018-11-23 11:59:23,832 INFO L273 TraceCheckUtils]: 99: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2018-11-23 11:59:23,832 INFO L273 TraceCheckUtils]: 100: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2018-11-23 11:59:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 11:59:23,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:23,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:23,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 11:59:23,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:23,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:23,907 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:59:23,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:23,908 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 12 states. [2018-11-23 11:59:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,428 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2018-11-23 11:59:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:24,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 11:59:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2018-11-23 11:59:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2018-11-23 11:59:24,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2018-11-23 11:59:24,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:24,581 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:59:24,581 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:59:24,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:59:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-23 11:59:24,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:24,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 108 states. [2018-11-23 11:59:24,627 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 108 states. [2018-11-23 11:59:24,627 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 108 states. [2018-11-23 11:59:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,631 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-11-23 11:59:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-11-23 11:59:24,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,631 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 109 states. [2018-11-23 11:59:24,631 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 109 states. [2018-11-23 11:59:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,634 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-11-23 11:59:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-11-23 11:59:24,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:24,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:59:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-11-23 11:59:24,636 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 101 [2018-11-23 11:59:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:24,637 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-11-23 11:59:24,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-23 11:59:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:59:24,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:24,638 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:24,638 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:24,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1229543484, now seen corresponding path program 9 times [2018-11-23 11:59:24,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:24,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2018-11-23 11:59:25,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6614#true} is VALID [2018-11-23 11:59:25,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2018-11-23 11:59:25,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #133#return; {6614#true} is VALID [2018-11-23 11:59:25,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2018-11-23 11:59:25,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {6614#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6616#(= main_~a~0 0)} is VALID [2018-11-23 11:59:25,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {6616#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6616#(= main_~a~0 0)} is VALID [2018-11-23 11:59:25,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {6616#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6617#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {6617#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6617#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {6617#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6618#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {6618#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6618#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {6618#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6619#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {6619#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6619#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {6619#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6620#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {6620#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6620#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {6620#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6621#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {6621#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6621#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {6621#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6622#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {6622#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6622#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {6622#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6623#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {6623#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6623#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {6623#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6624#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {6624#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6624#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {6624#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6625#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {6625#(<= main_~a~0 9)} assume !(~a~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {6615#false} havoc ~i~0;~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6615#false} is VALID [2018-11-23 11:59:25,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {6615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6615#false} is VALID [2018-11-23 11:59:25,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6615#false} is VALID [2018-11-23 11:59:25,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {6615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6615#false} is VALID [2018-11-23 11:59:25,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6615#false} is VALID [2018-11-23 11:59:25,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {6615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6615#false} is VALID [2018-11-23 11:59:25,522 INFO L273 TraceCheckUtils]: 32: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6615#false} is VALID [2018-11-23 11:59:25,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {6615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6615#false} is VALID [2018-11-23 11:59:25,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {6615#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {6615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 41: Hoare triple {6615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 42: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6615#false} is VALID [2018-11-23 11:59:25,523 INFO L273 TraceCheckUtils]: 43: Hoare triple {6615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 45: Hoare triple {6615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 46: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 47: Hoare triple {6615#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 50: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6615#false} is VALID [2018-11-23 11:59:25,524 INFO L273 TraceCheckUtils]: 51: Hoare triple {6615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 53: Hoare triple {6615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 54: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 55: Hoare triple {6615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 56: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 57: Hoare triple {6615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 58: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 59: Hoare triple {6615#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6615#false} is VALID [2018-11-23 11:59:25,525 INFO L273 TraceCheckUtils]: 60: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {6615#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 64: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 65: Hoare triple {6615#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 66: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {6615#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 68: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6615#false} is VALID [2018-11-23 11:59:25,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {6615#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 70: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 71: Hoare triple {6615#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 72: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 73: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 74: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 75: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 76: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:25,527 INFO L273 TraceCheckUtils]: 77: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 78: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 79: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 80: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 81: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 82: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 83: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 84: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 87: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 88: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 89: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 90: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 91: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 92: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 93: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:25,529 INFO L273 TraceCheckUtils]: 94: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 95: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 96: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 97: Hoare triple {6615#false} havoc ~x~0;~x~0 := 0; {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 98: Hoare triple {6615#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L256 TraceCheckUtils]: 99: Hoare triple {6615#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 100: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 101: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2018-11-23 11:59:25,530 INFO L273 TraceCheckUtils]: 102: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2018-11-23 11:59:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 11:59:25,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:25,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:25,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:27,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:59:27,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:27,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:27,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2018-11-23 11:59:27,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6614#true} is VALID [2018-11-23 11:59:27,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2018-11-23 11:59:27,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #133#return; {6614#true} is VALID [2018-11-23 11:59:27,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2018-11-23 11:59:27,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {6614#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6614#true} is VALID [2018-11-23 11:59:27,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {6614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {6614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {6614#true} assume !(~a~0 < 100000); {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {6614#true} havoc ~i~0;~i~0 := 0; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {6614#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {6614#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6614#true} is VALID [2018-11-23 11:59:27,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {6614#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {6614#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {6614#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {6614#true} assume !(~i~0 < 100000); {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {6614#true} ~i~0 := 0; {6614#true} is VALID [2018-11-23 11:59:27,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {6614#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {6614#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {6614#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {6614#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6614#true} is VALID [2018-11-23 11:59:27,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6614#true} is VALID [2018-11-23 11:59:27,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {6614#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6614#true} is VALID [2018-11-23 11:59:27,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {6614#true} assume !(~i~0 < 100000); {6614#true} is VALID [2018-11-23 11:59:27,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {6614#true} ~i~0 := 0; {6614#true} is VALID [2018-11-23 11:59:27,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6614#true} is VALID [2018-11-23 11:59:27,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {6614#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6614#true} is VALID [2018-11-23 11:59:27,624 INFO L273 TraceCheckUtils]: 52: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6614#true} is VALID [2018-11-23 11:59:27,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {6614#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6614#true} is VALID [2018-11-23 11:59:27,624 INFO L273 TraceCheckUtils]: 54: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6614#true} is VALID [2018-11-23 11:59:27,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {6614#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6614#true} is VALID [2018-11-23 11:59:27,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6614#true} is VALID [2018-11-23 11:59:27,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {6614#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6614#true} is VALID [2018-11-23 11:59:27,625 INFO L273 TraceCheckUtils]: 58: Hoare triple {6614#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6614#true} is VALID [2018-11-23 11:59:27,625 INFO L273 TraceCheckUtils]: 59: Hoare triple {6614#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6614#true} is VALID [2018-11-23 11:59:27,625 INFO L273 TraceCheckUtils]: 60: Hoare triple {6614#true} assume !(~i~0 < 100000); {6614#true} is VALID [2018-11-23 11:59:27,641 INFO L273 TraceCheckUtils]: 61: Hoare triple {6614#true} ~i~0 := 0; {6812#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:27,641 INFO L273 TraceCheckUtils]: 62: Hoare triple {6812#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6812#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:27,642 INFO L273 TraceCheckUtils]: 63: Hoare triple {6812#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6819#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,642 INFO L273 TraceCheckUtils]: 64: Hoare triple {6819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6819#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:27,643 INFO L273 TraceCheckUtils]: 65: Hoare triple {6819#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6826#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,643 INFO L273 TraceCheckUtils]: 66: Hoare triple {6826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6826#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:27,644 INFO L273 TraceCheckUtils]: 67: Hoare triple {6826#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6833#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,644 INFO L273 TraceCheckUtils]: 68: Hoare triple {6833#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6833#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:27,644 INFO L273 TraceCheckUtils]: 69: Hoare triple {6833#(<= main_~i~0 3)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6840#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {6840#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6840#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:27,645 INFO L273 TraceCheckUtils]: 71: Hoare triple {6840#(<= main_~i~0 4)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6847#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:27,645 INFO L273 TraceCheckUtils]: 72: Hoare triple {6847#(<= main_~i~0 5)} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:27,646 INFO L273 TraceCheckUtils]: 73: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:27,646 INFO L273 TraceCheckUtils]: 74: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:27,646 INFO L273 TraceCheckUtils]: 75: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:27,646 INFO L273 TraceCheckUtils]: 76: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:27,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:27,647 INFO L273 TraceCheckUtils]: 78: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:27,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:27,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:27,647 INFO L273 TraceCheckUtils]: 81: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:27,647 INFO L273 TraceCheckUtils]: 82: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6615#false} is VALID [2018-11-23 11:59:27,648 INFO L273 TraceCheckUtils]: 83: Hoare triple {6615#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6615#false} is VALID [2018-11-23 11:59:27,648 INFO L273 TraceCheckUtils]: 84: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:27,648 INFO L273 TraceCheckUtils]: 85: Hoare triple {6615#false} ~i~0 := 0; {6615#false} is VALID [2018-11-23 11:59:27,648 INFO L273 TraceCheckUtils]: 86: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:27,648 INFO L273 TraceCheckUtils]: 87: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 88: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 89: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 90: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 91: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 92: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 93: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 94: Hoare triple {6615#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6615#false} is VALID [2018-11-23 11:59:27,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {6615#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L273 TraceCheckUtils]: 96: Hoare triple {6615#false} assume !(~i~0 < 100000); {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L273 TraceCheckUtils]: 97: Hoare triple {6615#false} havoc ~x~0;~x~0 := 0; {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {6615#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L256 TraceCheckUtils]: 99: Hoare triple {6615#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L273 TraceCheckUtils]: 100: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L273 TraceCheckUtils]: 101: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2018-11-23 11:59:27,650 INFO L273 TraceCheckUtils]: 102: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2018-11-23 11:59:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 11:59:27,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:27,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:59:27,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-11-23 11:59:27,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:27,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:59:27,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:27,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:59:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:59:27,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:27,752 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 18 states. [2018-11-23 11:59:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:28,804 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2018-11-23 11:59:28,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:28,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-11-23 11:59:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2018-11-23 11:59:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2018-11-23 11:59:28,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 178 transitions. [2018-11-23 11:59:29,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:29,396 INFO L225 Difference]: With dead ends: 212 [2018-11-23 11:59:29,396 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 11:59:29,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 11:59:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-11-23 11:59:29,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:29,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 122 states. [2018-11-23 11:59:29,470 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 122 states. [2018-11-23 11:59:29,470 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 122 states. [2018-11-23 11:59:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:29,473 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-11-23 11:59:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-11-23 11:59:29,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:29,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:29,473 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 129 states. [2018-11-23 11:59:29,473 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 129 states. [2018-11-23 11:59:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:29,478 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-11-23 11:59:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-11-23 11:59:29,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:29,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:29,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:29,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 11:59:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-23 11:59:29,482 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 103 [2018-11-23 11:59:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:29,483 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-23 11:59:29,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:59:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 11:59:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 11:59:29,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:29,484 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:29,485 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:29,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:29,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1669521358, now seen corresponding path program 10 times [2018-11-23 11:59:29,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:29,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:29,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:29,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:29,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:30,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {7691#true} call ULTIMATE.init(); {7691#true} is VALID [2018-11-23 11:59:30,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {7691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7691#true} is VALID [2018-11-23 11:59:30,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {7691#true} assume true; {7691#true} is VALID [2018-11-23 11:59:30,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7691#true} {7691#true} #133#return; {7691#true} is VALID [2018-11-23 11:59:30,978 INFO L256 TraceCheckUtils]: 4: Hoare triple {7691#true} call #t~ret17 := main(); {7691#true} is VALID [2018-11-23 11:59:30,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {7691#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7693#(= main_~a~0 0)} is VALID [2018-11-23 11:59:30,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {7693#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7693#(= main_~a~0 0)} is VALID [2018-11-23 11:59:30,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {7693#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7694#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:30,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {7694#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7694#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:30,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {7694#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7695#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:30,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {7695#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7695#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:30,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {7695#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7696#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:30,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {7696#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7696#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:30,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {7696#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7697#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:30,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {7697#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7697#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:30,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {7697#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7698#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:30,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {7698#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7698#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:30,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {7698#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7699#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:30,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {7699#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7699#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:30,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {7699#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7700#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:30,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {7700#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7700#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:30,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {7700#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7701#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:30,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {7701#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7701#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:30,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {7701#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7702#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:30,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {7702#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7702#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:30,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {7702#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7703#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:30,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {7703#(<= main_~a~0 10)} assume !(~a~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:30,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {7692#false} havoc ~i~0;~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:30,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:30,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:30,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:30,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:30,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:30,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:30,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:30,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:30,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:30,993 INFO L273 TraceCheckUtils]: 37: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:30,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:30,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:30,993 INFO L273 TraceCheckUtils]: 40: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:30,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:30,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 51: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 52: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 53: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 54: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 56: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:30,995 INFO L273 TraceCheckUtils]: 57: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 59: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 64: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:30,996 INFO L273 TraceCheckUtils]: 65: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 66: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 67: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 70: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 71: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 72: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 73: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:30,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 75: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 78: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 79: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 80: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:30,998 INFO L273 TraceCheckUtils]: 81: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:30,999 INFO L273 TraceCheckUtils]: 82: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:30,999 INFO L273 TraceCheckUtils]: 83: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:30,999 INFO L273 TraceCheckUtils]: 84: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:30,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:30,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,000 INFO L273 TraceCheckUtils]: 87: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,000 INFO L273 TraceCheckUtils]: 88: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,000 INFO L273 TraceCheckUtils]: 89: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,000 INFO L273 TraceCheckUtils]: 90: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,000 INFO L273 TraceCheckUtils]: 91: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,000 INFO L273 TraceCheckUtils]: 92: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,001 INFO L273 TraceCheckUtils]: 93: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,001 INFO L273 TraceCheckUtils]: 94: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,001 INFO L273 TraceCheckUtils]: 95: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,001 INFO L273 TraceCheckUtils]: 96: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,001 INFO L273 TraceCheckUtils]: 97: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,002 INFO L273 TraceCheckUtils]: 98: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,002 INFO L273 TraceCheckUtils]: 99: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,002 INFO L273 TraceCheckUtils]: 100: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,002 INFO L273 TraceCheckUtils]: 101: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,002 INFO L273 TraceCheckUtils]: 102: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,002 INFO L273 TraceCheckUtils]: 103: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 104: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 105: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 106: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 107: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 108: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 109: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,003 INFO L273 TraceCheckUtils]: 110: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,004 INFO L273 TraceCheckUtils]: 111: Hoare triple {7692#false} havoc ~x~0;~x~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,004 INFO L273 TraceCheckUtils]: 112: Hoare triple {7692#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {7692#false} is VALID [2018-11-23 11:59:31,004 INFO L256 TraceCheckUtils]: 113: Hoare triple {7692#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {7692#false} is VALID [2018-11-23 11:59:31,004 INFO L273 TraceCheckUtils]: 114: Hoare triple {7692#false} ~cond := #in~cond; {7692#false} is VALID [2018-11-23 11:59:31,004 INFO L273 TraceCheckUtils]: 115: Hoare triple {7692#false} assume 0 == ~cond; {7692#false} is VALID [2018-11-23 11:59:31,004 INFO L273 TraceCheckUtils]: 116: Hoare triple {7692#false} assume !false; {7692#false} is VALID [2018-11-23 11:59:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 11:59:31,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:31,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:31,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:31,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:31,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:31,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {7691#true} call ULTIMATE.init(); {7691#true} is VALID [2018-11-23 11:59:31,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {7691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7691#true} is VALID [2018-11-23 11:59:31,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {7691#true} assume true; {7691#true} is VALID [2018-11-23 11:59:31,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7691#true} {7691#true} #133#return; {7691#true} is VALID [2018-11-23 11:59:31,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {7691#true} call #t~ret17 := main(); {7691#true} is VALID [2018-11-23 11:59:31,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {7691#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7722#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:31,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {7722#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7722#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:31,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {7722#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7694#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:31,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {7694#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7694#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:31,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {7694#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7695#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:31,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {7695#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7695#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:31,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {7695#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7696#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:31,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {7696#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7696#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:31,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {7696#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7697#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:31,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {7697#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7697#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:31,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {7697#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7698#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:31,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {7698#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7698#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:31,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {7698#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7699#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:31,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {7699#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7699#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:31,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {7699#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7700#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:31,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {7700#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7700#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:31,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {7700#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7701#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:31,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {7701#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7701#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:31,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {7701#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7702#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:31,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {7702#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7702#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:31,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {7702#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7703#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:31,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {7703#(<= main_~a~0 10)} assume !(~a~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {7692#false} havoc ~i~0;~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:31,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:31,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:31,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:31,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:31,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:31,468 INFO L273 TraceCheckUtils]: 34: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:31,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:31,469 INFO L273 TraceCheckUtils]: 36: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:31,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:31,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7692#false} is VALID [2018-11-23 11:59:31,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {7692#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7692#false} is VALID [2018-11-23 11:59:31,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:31,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:31,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:31,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:31,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 47: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 51: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {7692#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7692#false} is VALID [2018-11-23 11:59:31,471 INFO L273 TraceCheckUtils]: 54: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 55: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 57: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 60: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 61: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 62: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:31,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 64: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 66: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {7692#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:31,473 INFO L273 TraceCheckUtils]: 71: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 73: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 74: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 75: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 76: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 77: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 78: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 79: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:31,474 INFO L273 TraceCheckUtils]: 80: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 81: Hoare triple {7692#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 82: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 83: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 84: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 85: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 86: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 87: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 88: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,475 INFO L273 TraceCheckUtils]: 89: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 90: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 91: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 92: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 93: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 94: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 95: Hoare triple {7692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 96: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {7692#false} ~i~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 99: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 100: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 101: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 102: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 103: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 105: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,477 INFO L273 TraceCheckUtils]: 106: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 107: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 108: Hoare triple {7692#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 109: Hoare triple {7692#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 110: Hoare triple {7692#false} assume !(~i~0 < 100000); {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 111: Hoare triple {7692#false} havoc ~x~0;~x~0 := 0; {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 112: Hoare triple {7692#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L256 TraceCheckUtils]: 113: Hoare triple {7692#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 114: Hoare triple {7692#false} ~cond := #in~cond; {7692#false} is VALID [2018-11-23 11:59:31,478 INFO L273 TraceCheckUtils]: 115: Hoare triple {7692#false} assume 0 == ~cond; {7692#false} is VALID [2018-11-23 11:59:31,479 INFO L273 TraceCheckUtils]: 116: Hoare triple {7692#false} assume !false; {7692#false} is VALID [2018-11-23 11:59:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 11:59:31,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:31,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:59:31,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-23 11:59:31,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:31,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:31,565 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:59:31,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:31,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:31,566 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 14 states. [2018-11-23 11:59:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,962 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-11-23 11:59:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:31,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-23 11:59:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2018-11-23 11:59:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2018-11-23 11:59:31,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 102 transitions. [2018-11-23 11:59:32,578 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:32,581 INFO L225 Difference]: With dead ends: 220 [2018-11-23 11:59:32,581 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:59:32,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:59:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-11-23 11:59:32,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:32,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 124 states. [2018-11-23 11:59:32,636 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 124 states. [2018-11-23 11:59:32,636 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 124 states. [2018-11-23 11:59:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:32,639 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-11-23 11:59:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-11-23 11:59:32,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:32,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:32,640 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 125 states. [2018-11-23 11:59:32,640 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 125 states. [2018-11-23 11:59:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:32,643 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-11-23 11:59:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-11-23 11:59:32,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:32,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:32,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:32,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 11:59:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-11-23 11:59:32,646 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 117 [2018-11-23 11:59:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:32,646 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-11-23 11:59:32,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-11-23 11:59:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 11:59:32,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:32,648 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:32,648 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:32,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash 598541804, now seen corresponding path program 11 times [2018-11-23 11:59:32,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:32,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:32,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {8816#true} call ULTIMATE.init(); {8816#true} is VALID [2018-11-23 11:59:32,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {8816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8816#true} is VALID [2018-11-23 11:59:32,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {8816#true} assume true; {8816#true} is VALID [2018-11-23 11:59:32,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8816#true} {8816#true} #133#return; {8816#true} is VALID [2018-11-23 11:59:32,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {8816#true} call #t~ret17 := main(); {8816#true} is VALID [2018-11-23 11:59:32,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {8816#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8818#(= main_~a~0 0)} is VALID [2018-11-23 11:59:32,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {8818#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8818#(= main_~a~0 0)} is VALID [2018-11-23 11:59:32,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {8818#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8819#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:32,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {8819#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8819#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:32,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {8819#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8820#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:32,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {8820#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8820#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:32,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {8820#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8821#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:32,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {8821#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8821#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:32,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {8821#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8822#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:32,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {8822#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8822#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:32,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {8822#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8823#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:32,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {8823#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8823#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:32,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {8823#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8824#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:32,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {8824#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8824#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:32,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {8824#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8825#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:32,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {8825#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8825#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:32,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {8825#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8826#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:32,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {8826#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8826#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:32,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {8826#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8827#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:32,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {8827#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8827#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:32,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {8827#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8828#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:32,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {8828#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8828#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:32,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {8828#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8829#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:32,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {8829#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,932 INFO L273 TraceCheckUtils]: 29: Hoare triple {8817#false} havoc ~i~0;~i~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,932 INFO L273 TraceCheckUtils]: 30: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 31: Hoare triple {8817#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 32: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {8817#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {8817#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {8817#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8817#false} is VALID [2018-11-23 11:59:32,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {8817#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {8817#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 42: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {8817#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 46: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 47: Hoare triple {8817#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8817#false} is VALID [2018-11-23 11:59:32,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {8817#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {8817#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 53: Hoare triple {8817#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 54: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 55: Hoare triple {8817#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 56: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,935 INFO L273 TraceCheckUtils]: 57: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 58: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 59: Hoare triple {8817#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 60: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 61: Hoare triple {8817#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {8817#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {8817#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8817#false} is VALID [2018-11-23 11:59:32,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {8817#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 68: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {8817#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 71: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 72: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 73: Hoare triple {8817#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8817#false} is VALID [2018-11-23 11:59:32,937 INFO L273 TraceCheckUtils]: 74: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8817#false} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 75: Hoare triple {8817#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8817#false} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 76: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8817#false} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 77: Hoare triple {8817#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8817#false} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 78: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8817#false} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 79: Hoare triple {8817#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8817#false} is VALID [2018-11-23 11:59:32,938 INFO L273 TraceCheckUtils]: 80: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8817#false} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 81: Hoare triple {8817#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8817#false} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 82: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8817#false} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 83: Hoare triple {8817#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8817#false} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 84: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 85: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,939 INFO L273 TraceCheckUtils]: 86: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 87: Hoare triple {8817#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 88: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 89: Hoare triple {8817#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 90: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 91: Hoare triple {8817#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 92: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8817#false} is VALID [2018-11-23 11:59:32,940 INFO L273 TraceCheckUtils]: 93: Hoare triple {8817#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8817#false} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 94: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8817#false} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 95: Hoare triple {8817#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8817#false} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 96: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8817#false} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 97: Hoare triple {8817#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8817#false} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 98: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,941 INFO L273 TraceCheckUtils]: 99: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 100: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 101: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 102: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 103: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 104: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 11:59:32,942 INFO L273 TraceCheckUtils]: 105: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 106: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 107: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 108: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 109: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 110: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 11:59:32,943 INFO L273 TraceCheckUtils]: 111: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 112: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 113: Hoare triple {8817#false} havoc ~x~0;~x~0 := 0; {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 114: Hoare triple {8817#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L256 TraceCheckUtils]: 115: Hoare triple {8817#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 116: Hoare triple {8817#false} ~cond := #in~cond; {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 117: Hoare triple {8817#false} assume 0 == ~cond; {8817#false} is VALID [2018-11-23 11:59:32,944 INFO L273 TraceCheckUtils]: 118: Hoare triple {8817#false} assume !false; {8817#false} is VALID [2018-11-23 11:59:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 11:59:32,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:32,951 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:59:32,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:15,737 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:00:15,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:15,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:16,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {8816#true} call ULTIMATE.init(); {8816#true} is VALID [2018-11-23 12:00:16,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {8816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8816#true} is VALID [2018-11-23 12:00:16,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {8816#true} assume true; {8816#true} is VALID [2018-11-23 12:00:16,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8816#true} {8816#true} #133#return; {8816#true} is VALID [2018-11-23 12:00:16,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {8816#true} call #t~ret17 := main(); {8816#true} is VALID [2018-11-23 12:00:16,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {8816#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8816#true} is VALID [2018-11-23 12:00:16,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {8816#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {8816#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 28: Hoare triple {8816#true} assume !(~a~0 < 100000); {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {8816#true} havoc ~i~0;~i~0 := 0; {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 31: Hoare triple {8816#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#true} is VALID [2018-11-23 12:00:16,037 INFO L273 TraceCheckUtils]: 32: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8816#true} is VALID [2018-11-23 12:00:16,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {8816#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#true} is VALID [2018-11-23 12:00:16,038 INFO L273 TraceCheckUtils]: 34: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8816#true} is VALID [2018-11-23 12:00:16,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {8816#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#true} is VALID [2018-11-23 12:00:16,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8816#true} is VALID [2018-11-23 12:00:16,038 INFO L273 TraceCheckUtils]: 37: Hoare triple {8816#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#true} is VALID [2018-11-23 12:00:16,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 39: Hoare triple {8816#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 40: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 41: Hoare triple {8816#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {8816#true} assume !(~i~0 < 100000); {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {8816#true} ~i~0 := 0; {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8816#true} is VALID [2018-11-23 12:00:16,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {8816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 46: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {8816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {8816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 50: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 51: Hoare triple {8816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8816#true} is VALID [2018-11-23 12:00:16,040 INFO L273 TraceCheckUtils]: 52: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 53: Hoare triple {8816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {8816#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 56: Hoare triple {8816#true} assume !(~i~0 < 100000); {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 57: Hoare triple {8816#true} ~i~0 := 0; {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 58: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8816#true} is VALID [2018-11-23 12:00:16,041 INFO L273 TraceCheckUtils]: 59: Hoare triple {8816#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 60: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 61: Hoare triple {8816#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 62: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 63: Hoare triple {8816#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 64: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 65: Hoare triple {8816#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8816#true} is VALID [2018-11-23 12:00:16,042 INFO L273 TraceCheckUtils]: 66: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 67: Hoare triple {8816#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 68: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 69: Hoare triple {8816#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 70: Hoare triple {8816#true} assume !(~i~0 < 100000); {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 71: Hoare triple {8816#true} ~i~0 := 0; {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 72: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8816#true} is VALID [2018-11-23 12:00:16,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {8816#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8816#true} is VALID [2018-11-23 12:00:16,044 INFO L273 TraceCheckUtils]: 74: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8816#true} is VALID [2018-11-23 12:00:16,044 INFO L273 TraceCheckUtils]: 75: Hoare triple {8816#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8816#true} is VALID [2018-11-23 12:00:16,044 INFO L273 TraceCheckUtils]: 76: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8816#true} is VALID [2018-11-23 12:00:16,044 INFO L273 TraceCheckUtils]: 77: Hoare triple {8816#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8816#true} is VALID [2018-11-23 12:00:16,044 INFO L273 TraceCheckUtils]: 78: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8816#true} is VALID [2018-11-23 12:00:16,044 INFO L273 TraceCheckUtils]: 79: Hoare triple {8816#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8816#true} is VALID [2018-11-23 12:00:16,045 INFO L273 TraceCheckUtils]: 80: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8816#true} is VALID [2018-11-23 12:00:16,045 INFO L273 TraceCheckUtils]: 81: Hoare triple {8816#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8816#true} is VALID [2018-11-23 12:00:16,045 INFO L273 TraceCheckUtils]: 82: Hoare triple {8816#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8816#true} is VALID [2018-11-23 12:00:16,045 INFO L273 TraceCheckUtils]: 83: Hoare triple {8816#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8816#true} is VALID [2018-11-23 12:00:16,045 INFO L273 TraceCheckUtils]: 84: Hoare triple {8816#true} assume !(~i~0 < 100000); {8816#true} is VALID [2018-11-23 12:00:16,046 INFO L273 TraceCheckUtils]: 85: Hoare triple {8816#true} ~i~0 := 0; {9088#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:16,046 INFO L273 TraceCheckUtils]: 86: Hoare triple {9088#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {9088#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:16,048 INFO L273 TraceCheckUtils]: 87: Hoare triple {9088#(<= main_~i~0 0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9095#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:16,048 INFO L273 TraceCheckUtils]: 88: Hoare triple {9095#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {9095#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:16,049 INFO L273 TraceCheckUtils]: 89: Hoare triple {9095#(<= main_~i~0 1)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9102#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:16,049 INFO L273 TraceCheckUtils]: 90: Hoare triple {9102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {9102#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:16,049 INFO L273 TraceCheckUtils]: 91: Hoare triple {9102#(<= main_~i~0 2)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9109#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:16,050 INFO L273 TraceCheckUtils]: 92: Hoare triple {9109#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {9109#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:16,050 INFO L273 TraceCheckUtils]: 93: Hoare triple {9109#(<= main_~i~0 3)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9116#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:16,051 INFO L273 TraceCheckUtils]: 94: Hoare triple {9116#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {9116#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:16,051 INFO L273 TraceCheckUtils]: 95: Hoare triple {9116#(<= main_~i~0 4)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9123#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:16,052 INFO L273 TraceCheckUtils]: 96: Hoare triple {9123#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {9123#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:16,053 INFO L273 TraceCheckUtils]: 97: Hoare triple {9123#(<= main_~i~0 5)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9130#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:16,054 INFO L273 TraceCheckUtils]: 98: Hoare triple {9130#(<= main_~i~0 6)} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 12:00:16,054 INFO L273 TraceCheckUtils]: 99: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 12:00:16,054 INFO L273 TraceCheckUtils]: 100: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 12:00:16,054 INFO L273 TraceCheckUtils]: 101: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 12:00:16,055 INFO L273 TraceCheckUtils]: 102: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 12:00:16,055 INFO L273 TraceCheckUtils]: 103: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 12:00:16,055 INFO L273 TraceCheckUtils]: 104: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 12:00:16,055 INFO L273 TraceCheckUtils]: 105: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 12:00:16,056 INFO L273 TraceCheckUtils]: 106: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 12:00:16,056 INFO L273 TraceCheckUtils]: 107: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 12:00:16,056 INFO L273 TraceCheckUtils]: 108: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 12:00:16,056 INFO L273 TraceCheckUtils]: 109: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 12:00:16,056 INFO L273 TraceCheckUtils]: 110: Hoare triple {8817#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L273 TraceCheckUtils]: 111: Hoare triple {8817#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L273 TraceCheckUtils]: 112: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L273 TraceCheckUtils]: 113: Hoare triple {8817#false} havoc ~x~0;~x~0 := 0; {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L273 TraceCheckUtils]: 114: Hoare triple {8817#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L256 TraceCheckUtils]: 115: Hoare triple {8817#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L273 TraceCheckUtils]: 116: Hoare triple {8817#false} ~cond := #in~cond; {8817#false} is VALID [2018-11-23 12:00:16,057 INFO L273 TraceCheckUtils]: 117: Hoare triple {8817#false} assume 0 == ~cond; {8817#false} is VALID [2018-11-23 12:00:16,058 INFO L273 TraceCheckUtils]: 118: Hoare triple {8817#false} assume !false; {8817#false} is VALID [2018-11-23 12:00:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 12:00:16,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:16,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2018-11-23 12:00:16,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-11-23 12:00:16,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:16,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:00:16,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:16,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:00:16,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:00:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:00:16,195 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 21 states. [2018-11-23 12:00:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:18,007 INFO L93 Difference]: Finished difference Result 240 states and 260 transitions. [2018-11-23 12:00:18,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:00:18,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-11-23 12:00:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:00:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2018-11-23 12:00:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:00:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2018-11-23 12:00:18,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 194 transitions. [2018-11-23 12:00:18,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:18,371 INFO L225 Difference]: With dead ends: 240 [2018-11-23 12:00:18,371 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:00:18,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:00:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:00:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2018-11-23 12:00:18,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:18,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 138 states. [2018-11-23 12:00:18,448 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 138 states. [2018-11-23 12:00:18,448 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 138 states. [2018-11-23 12:00:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:18,452 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2018-11-23 12:00:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-11-23 12:00:18,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:18,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:18,453 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 145 states. [2018-11-23 12:00:18,453 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 145 states. [2018-11-23 12:00:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:18,456 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2018-11-23 12:00:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-11-23 12:00:18,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:18,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:18,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:18,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 12:00:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-11-23 12:00:18,460 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 119 [2018-11-23 12:00:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:18,460 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-11-23 12:00:18,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:00:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-11-23 12:00:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:00:18,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:18,462 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:18,463 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:18,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash -803120770, now seen corresponding path program 12 times [2018-11-23 12:00:18,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:18,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:19,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {10042#true} call ULTIMATE.init(); {10042#true} is VALID [2018-11-23 12:00:19,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {10042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10042#true} is VALID [2018-11-23 12:00:19,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {10042#true} assume true; {10042#true} is VALID [2018-11-23 12:00:19,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10042#true} {10042#true} #133#return; {10042#true} is VALID [2018-11-23 12:00:19,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {10042#true} call #t~ret17 := main(); {10042#true} is VALID [2018-11-23 12:00:19,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {10042#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10044#(= main_~a~0 0)} is VALID [2018-11-23 12:00:19,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {10044#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10044#(= main_~a~0 0)} is VALID [2018-11-23 12:00:19,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {10044#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:19,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {10045#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10045#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:19,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {10045#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:19,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {10046#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10046#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:19,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {10046#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:19,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {10047#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10047#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:19,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {10047#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:19,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {10048#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10048#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:19,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {10048#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:19,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {10049#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10049#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:19,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {10049#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:19,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {10050#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10050#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:19,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {10050#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:19,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {10051#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10051#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:19,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {10051#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:19,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {10052#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10052#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:19,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {10052#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:19,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {10053#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10053#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:19,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {10053#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:19,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {10054#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10054#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:19,378 INFO L273 TraceCheckUtils]: 27: Hoare triple {10054#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:19,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {10055#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10055#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:19,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {10055#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:19,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~a~0 12)} assume !(~a~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {10043#false} havoc ~i~0;~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,381 INFO L273 TraceCheckUtils]: 35: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,381 INFO L273 TraceCheckUtils]: 36: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,382 INFO L273 TraceCheckUtils]: 37: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 43: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 45: Hoare triple {10043#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 46: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 47: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 48: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 49: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 51: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 52: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 54: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 55: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 56: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 57: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 60: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 61: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 62: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 63: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 64: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 65: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 66: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 67: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,385 INFO L273 TraceCheckUtils]: 68: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 69: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 70: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 71: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 72: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 73: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 74: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:19,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 78: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 79: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 80: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 81: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 82: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 83: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 85: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,387 INFO L273 TraceCheckUtils]: 86: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 87: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 88: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 89: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 90: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 91: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 92: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 93: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 96: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 97: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 98: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 99: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 100: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 101: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,389 INFO L273 TraceCheckUtils]: 103: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 104: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 105: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 106: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 107: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 108: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 109: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 110: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 111: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,390 INFO L273 TraceCheckUtils]: 112: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 113: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 114: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 115: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 116: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 117: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 118: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 119: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 120: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,391 INFO L273 TraceCheckUtils]: 121: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 122: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 123: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 124: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 125: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 126: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 127: Hoare triple {10043#false} havoc ~x~0;~x~0 := 0; {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 128: Hoare triple {10043#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L256 TraceCheckUtils]: 129: Hoare triple {10043#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {10043#false} is VALID [2018-11-23 12:00:19,392 INFO L273 TraceCheckUtils]: 130: Hoare triple {10043#false} ~cond := #in~cond; {10043#false} is VALID [2018-11-23 12:00:19,393 INFO L273 TraceCheckUtils]: 131: Hoare triple {10043#false} assume 0 == ~cond; {10043#false} is VALID [2018-11-23 12:00:19,393 INFO L273 TraceCheckUtils]: 132: Hoare triple {10043#false} assume !false; {10043#false} is VALID [2018-11-23 12:00:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-11-23 12:00:19,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:19,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:19,409 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:41,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:00:41,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:41,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:41,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {10042#true} call ULTIMATE.init(); {10042#true} is VALID [2018-11-23 12:00:41,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {10042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10042#true} is VALID [2018-11-23 12:00:41,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {10042#true} assume true; {10042#true} is VALID [2018-11-23 12:00:41,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10042#true} {10042#true} #133#return; {10042#true} is VALID [2018-11-23 12:00:41,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {10042#true} call #t~ret17 := main(); {10042#true} is VALID [2018-11-23 12:00:41,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {10042#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10042#true} is VALID [2018-11-23 12:00:41,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,870 INFO L273 TraceCheckUtils]: 26: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10042#true} is VALID [2018-11-23 12:00:41,871 INFO L273 TraceCheckUtils]: 27: Hoare triple {10042#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10042#true} is VALID [2018-11-23 12:00:41,871 INFO L273 TraceCheckUtils]: 28: Hoare triple {10042#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10144#(< main_~a~0 100000)} is VALID [2018-11-23 12:00:41,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {10144#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10148#(<= main_~a~0 100000)} is VALID [2018-11-23 12:00:41,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {10148#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {10042#true} is VALID [2018-11-23 12:00:41,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {10042#true} havoc ~i~0;~i~0 := 0; {10155#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:41,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {10155#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10155#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:41,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {10155#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10162#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:41,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {10162#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10162#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:41,874 INFO L273 TraceCheckUtils]: 35: Hoare triple {10162#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10169#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {10169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10169#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {10169#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10176#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {10176#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10176#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {10176#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10183#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {10183#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10183#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {10183#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10190#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {10190#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10190#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {10190#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10197#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {10197#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10197#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,880 INFO L273 TraceCheckUtils]: 45: Hoare triple {10197#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10204#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,880 INFO L273 TraceCheckUtils]: 46: Hoare triple {10204#(<= main_~i~0 7)} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:41,881 INFO L273 TraceCheckUtils]: 47: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:41,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,881 INFO L273 TraceCheckUtils]: 51: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,882 INFO L273 TraceCheckUtils]: 52: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,882 INFO L273 TraceCheckUtils]: 53: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,882 INFO L273 TraceCheckUtils]: 54: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,882 INFO L273 TraceCheckUtils]: 55: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,882 INFO L273 TraceCheckUtils]: 56: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,883 INFO L273 TraceCheckUtils]: 57: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,883 INFO L273 TraceCheckUtils]: 58: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,883 INFO L273 TraceCheckUtils]: 59: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,883 INFO L273 TraceCheckUtils]: 60: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10043#false} is VALID [2018-11-23 12:00:41,883 INFO L273 TraceCheckUtils]: 61: Hoare triple {10043#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10043#false} is VALID [2018-11-23 12:00:41,883 INFO L273 TraceCheckUtils]: 62: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:41,884 INFO L273 TraceCheckUtils]: 63: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:41,884 INFO L273 TraceCheckUtils]: 64: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,884 INFO L273 TraceCheckUtils]: 65: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,884 INFO L273 TraceCheckUtils]: 67: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,885 INFO L273 TraceCheckUtils]: 69: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,885 INFO L273 TraceCheckUtils]: 70: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,885 INFO L273 TraceCheckUtils]: 71: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,885 INFO L273 TraceCheckUtils]: 72: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 73: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 74: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 76: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 77: Hoare triple {10043#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 78: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:41,886 INFO L273 TraceCheckUtils]: 79: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 80: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 81: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 82: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 83: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 84: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 85: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 86: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 87: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,887 INFO L273 TraceCheckUtils]: 88: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 89: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 90: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 91: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 92: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 93: Hoare triple {10043#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 94: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 95: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 96: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,888 INFO L273 TraceCheckUtils]: 97: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 98: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 99: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 100: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 101: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 102: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 103: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 104: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 105: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,889 INFO L273 TraceCheckUtils]: 106: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 107: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 108: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 109: Hoare triple {10043#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 110: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 111: Hoare triple {10043#false} ~i~0 := 0; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 112: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 113: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 114: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,890 INFO L273 TraceCheckUtils]: 115: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 116: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 117: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 118: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 119: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 120: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 121: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 122: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 123: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,891 INFO L273 TraceCheckUtils]: 124: Hoare triple {10043#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 125: Hoare triple {10043#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 126: Hoare triple {10043#false} assume !(~i~0 < 100000); {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 127: Hoare triple {10043#false} havoc ~x~0;~x~0 := 0; {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 128: Hoare triple {10043#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L256 TraceCheckUtils]: 129: Hoare triple {10043#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 130: Hoare triple {10043#false} ~cond := #in~cond; {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 131: Hoare triple {10043#false} assume 0 == ~cond; {10043#false} is VALID [2018-11-23 12:00:41,892 INFO L273 TraceCheckUtils]: 132: Hoare triple {10043#false} assume !false; {10043#false} is VALID [2018-11-23 12:00:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-23 12:00:41,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:41,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-11-23 12:00:41,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-11-23 12:00:41,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:41,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:00:42,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:42,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:00:42,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:00:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:00:42,007 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 25 states. [2018-11-23 12:00:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,122 INFO L93 Difference]: Finished difference Result 267 states and 288 transitions. [2018-11-23 12:00:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:00:43,122 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-11-23 12:00:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:00:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 210 transitions. [2018-11-23 12:00:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:00:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 210 transitions. [2018-11-23 12:00:43,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 210 transitions. [2018-11-23 12:00:43,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:43,432 INFO L225 Difference]: With dead ends: 267 [2018-11-23 12:00:43,432 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 12:00:43,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:00:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 12:00:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2018-11-23 12:00:43,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:43,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 154 states. [2018-11-23 12:00:43,926 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 154 states. [2018-11-23 12:00:43,926 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 154 states. [2018-11-23 12:00:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,933 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-11-23 12:00:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-11-23 12:00:43,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:43,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:43,934 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 160 states. [2018-11-23 12:00:43,934 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 160 states. [2018-11-23 12:00:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,938 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-11-23 12:00:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-11-23 12:00:43,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:43,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:43,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:43,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 12:00:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-11-23 12:00:43,944 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 133 [2018-11-23 12:00:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:43,945 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-11-23 12:00:43,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:00:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-11-23 12:00:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-23 12:00:43,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:43,947 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:43,947 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:43,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1287299886, now seen corresponding path program 13 times [2018-11-23 12:00:43,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:43,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:43,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:43,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:43,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:44,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {11425#true} call ULTIMATE.init(); {11425#true} is VALID [2018-11-23 12:00:44,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {11425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11425#true} is VALID [2018-11-23 12:00:44,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {11425#true} assume true; {11425#true} is VALID [2018-11-23 12:00:44,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11425#true} {11425#true} #133#return; {11425#true} is VALID [2018-11-23 12:00:44,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {11425#true} call #t~ret17 := main(); {11425#true} is VALID [2018-11-23 12:00:44,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {11425#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11427#(= main_~a~0 0)} is VALID [2018-11-23 12:00:44,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {11427#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11427#(= main_~a~0 0)} is VALID [2018-11-23 12:00:44,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {11427#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11428#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:44,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {11428#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11428#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:44,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {11428#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11429#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:44,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {11429#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11429#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:44,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {11429#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11430#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:44,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {11430#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11430#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:44,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {11430#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11431#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:44,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {11431#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11431#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:44,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {11431#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11432#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:44,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {11432#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11432#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:44,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {11432#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11433#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:44,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {11433#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11433#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:44,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {11433#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11434#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:44,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {11434#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11434#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:44,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {11434#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11435#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:44,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {11435#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11435#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:44,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {11435#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11436#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:44,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {11436#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11436#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:44,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {11436#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11437#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:44,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {11437#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11437#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:44,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {11437#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11438#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:44,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {11438#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11438#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:44,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {11438#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11439#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:44,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {11439#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11439#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:44,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {11439#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:44,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {11440#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11440#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:44,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {11440#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11441#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:44,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {11441#(<= main_~a~0 14)} assume !(~a~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#false} havoc ~i~0;~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,473 INFO L273 TraceCheckUtils]: 44: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,473 INFO L273 TraceCheckUtils]: 46: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 47: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 48: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 50: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 52: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 54: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 56: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 57: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 58: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 61: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,475 INFO L273 TraceCheckUtils]: 62: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 63: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 64: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 65: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 67: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 68: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 69: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 70: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,476 INFO L273 TraceCheckUtils]: 71: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 74: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 78: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 79: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,477 INFO L273 TraceCheckUtils]: 80: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 81: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 82: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 83: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 84: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 85: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 86: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 87: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 88: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,478 INFO L273 TraceCheckUtils]: 89: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 90: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 91: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 92: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 93: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 94: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 95: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 96: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 97: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,479 INFO L273 TraceCheckUtils]: 98: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 99: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 100: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 101: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 102: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 103: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 104: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 105: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 106: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,480 INFO L273 TraceCheckUtils]: 107: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 108: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 109: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 110: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 111: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 112: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 113: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 114: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 115: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,481 INFO L273 TraceCheckUtils]: 116: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 117: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 118: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 119: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 120: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 121: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 122: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 123: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 124: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,482 INFO L273 TraceCheckUtils]: 125: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 126: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 127: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 128: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 129: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 130: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 131: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 132: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 133: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,483 INFO L273 TraceCheckUtils]: 134: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 135: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 136: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 137: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 138: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 139: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 140: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 141: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 142: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,484 INFO L273 TraceCheckUtils]: 143: Hoare triple {11426#false} havoc ~x~0;~x~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,485 INFO L273 TraceCheckUtils]: 144: Hoare triple {11426#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {11426#false} is VALID [2018-11-23 12:00:44,485 INFO L256 TraceCheckUtils]: 145: Hoare triple {11426#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {11426#false} is VALID [2018-11-23 12:00:44,485 INFO L273 TraceCheckUtils]: 146: Hoare triple {11426#false} ~cond := #in~cond; {11426#false} is VALID [2018-11-23 12:00:44,485 INFO L273 TraceCheckUtils]: 147: Hoare triple {11426#false} assume 0 == ~cond; {11426#false} is VALID [2018-11-23 12:00:44,485 INFO L273 TraceCheckUtils]: 148: Hoare triple {11426#false} assume !false; {11426#false} is VALID [2018-11-23 12:00:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:00:44,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:44,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:44,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:44,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:44,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {11425#true} call ULTIMATE.init(); {11425#true} is VALID [2018-11-23 12:00:44,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {11425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11425#true} is VALID [2018-11-23 12:00:44,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {11425#true} assume true; {11425#true} is VALID [2018-11-23 12:00:44,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11425#true} {11425#true} #133#return; {11425#true} is VALID [2018-11-23 12:00:44,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {11425#true} call #t~ret17 := main(); {11425#true} is VALID [2018-11-23 12:00:44,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {11425#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11460#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:44,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {11460#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11460#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:44,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {11460#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11428#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:44,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {11428#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11428#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:44,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {11428#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11429#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:44,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {11429#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11429#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:44,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {11429#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11430#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:44,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {11430#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11430#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:44,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {11430#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11431#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:44,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {11431#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11431#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:44,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {11431#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11432#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:44,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {11432#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11432#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:44,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {11432#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11433#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:44,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {11433#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11433#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:44,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {11433#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11434#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:44,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {11434#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11434#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:44,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {11434#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11435#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:44,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {11435#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11435#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:44,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {11435#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11436#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:44,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {11436#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11436#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:44,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {11436#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11437#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:44,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {11437#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11437#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:44,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {11437#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11438#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:44,809 INFO L273 TraceCheckUtils]: 28: Hoare triple {11438#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11438#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:44,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {11438#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11439#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:44,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {11439#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11439#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:44,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {11439#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:44,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {11440#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11440#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:44,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {11440#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11441#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:44,813 INFO L273 TraceCheckUtils]: 34: Hoare triple {11441#(<= main_~a~0 14)} assume !(~a~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#false} havoc ~i~0;~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,814 INFO L273 TraceCheckUtils]: 38: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,815 INFO L273 TraceCheckUtils]: 42: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,815 INFO L273 TraceCheckUtils]: 43: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,815 INFO L273 TraceCheckUtils]: 44: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,815 INFO L273 TraceCheckUtils]: 45: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,815 INFO L273 TraceCheckUtils]: 46: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,816 INFO L273 TraceCheckUtils]: 47: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,816 INFO L273 TraceCheckUtils]: 48: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,816 INFO L273 TraceCheckUtils]: 49: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,816 INFO L273 TraceCheckUtils]: 50: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11426#false} is VALID [2018-11-23 12:00:44,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {11426#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 55: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 56: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 57: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 59: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,817 INFO L273 TraceCheckUtils]: 60: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 61: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 62: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 63: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 64: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 65: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 66: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 67: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 68: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11426#false} is VALID [2018-11-23 12:00:44,818 INFO L273 TraceCheckUtils]: 69: Hoare triple {11426#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 70: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 71: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 72: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 73: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 74: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 75: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 76: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 81: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 82: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 83: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 84: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 85: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,820 INFO L273 TraceCheckUtils]: 86: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 87: Hoare triple {11426#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 88: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 89: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 90: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 91: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 92: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 93: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 94: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,821 INFO L273 TraceCheckUtils]: 95: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 96: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 97: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 98: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 99: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 100: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 101: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 103: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,822 INFO L273 TraceCheckUtils]: 104: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 105: Hoare triple {11426#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 106: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 107: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 108: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 109: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 110: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 111: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 112: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,823 INFO L273 TraceCheckUtils]: 113: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 114: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 115: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 116: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 117: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 118: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 119: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 120: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 121: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,824 INFO L273 TraceCheckUtils]: 122: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 123: Hoare triple {11426#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 124: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 125: Hoare triple {11426#false} ~i~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 126: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 127: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 128: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 129: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,825 INFO L273 TraceCheckUtils]: 130: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 131: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 132: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 133: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 134: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 135: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 136: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 137: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 138: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,826 INFO L273 TraceCheckUtils]: 139: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 140: Hoare triple {11426#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 141: Hoare triple {11426#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 142: Hoare triple {11426#false} assume !(~i~0 < 100000); {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 143: Hoare triple {11426#false} havoc ~x~0;~x~0 := 0; {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 144: Hoare triple {11426#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L256 TraceCheckUtils]: 145: Hoare triple {11426#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 146: Hoare triple {11426#false} ~cond := #in~cond; {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 147: Hoare triple {11426#false} assume 0 == ~cond; {11426#false} is VALID [2018-11-23 12:00:44,827 INFO L273 TraceCheckUtils]: 148: Hoare triple {11426#false} assume !false; {11426#false} is VALID [2018-11-23 12:00:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:00:44,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:44,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:00:44,856 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-11-23 12:00:44,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:44,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:00:44,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:44,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:00:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:00:44,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:00:44,921 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 18 states. [2018-11-23 12:00:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:45,962 INFO L93 Difference]: Finished difference Result 276 states and 290 transitions. [2018-11-23 12:00:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:00:45,962 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-11-23 12:00:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-23 12:00:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-23 12:00:45,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2018-11-23 12:00:46,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:46,078 INFO L225 Difference]: With dead ends: 276 [2018-11-23 12:00:46,078 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 12:00:46,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:00:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 12:00:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-11-23 12:00:46,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:46,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 156 states. [2018-11-23 12:00:46,202 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 156 states. [2018-11-23 12:00:46,203 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 156 states. [2018-11-23 12:00:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:46,208 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-11-23 12:00:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2018-11-23 12:00:46,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:46,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:46,208 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 157 states. [2018-11-23 12:00:46,209 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 157 states. [2018-11-23 12:00:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:46,212 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-11-23 12:00:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2018-11-23 12:00:46,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:46,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:46,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:46,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 12:00:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2018-11-23 12:00:46,216 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 149 [2018-11-23 12:00:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:46,216 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2018-11-23 12:00:46,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:00:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2018-11-23 12:00:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:00:46,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:46,218 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:46,218 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:46,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1441476276, now seen corresponding path program 14 times [2018-11-23 12:00:46,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:46,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:46,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {12846#true} call ULTIMATE.init(); {12846#true} is VALID [2018-11-23 12:00:46,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {12846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12846#true} is VALID [2018-11-23 12:00:46,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {12846#true} assume true; {12846#true} is VALID [2018-11-23 12:00:46,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12846#true} {12846#true} #133#return; {12846#true} is VALID [2018-11-23 12:00:46,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {12846#true} call #t~ret17 := main(); {12846#true} is VALID [2018-11-23 12:00:46,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {12846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12848#(= main_~a~0 0)} is VALID [2018-11-23 12:00:46,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {12848#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12848#(= main_~a~0 0)} is VALID [2018-11-23 12:00:46,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {12848#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12849#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:46,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {12849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12849#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:46,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {12849#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12850#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:46,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {12850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12850#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:46,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {12850#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12851#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:46,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {12851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12851#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:46,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {12851#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12852#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:46,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {12852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12852#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:46,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {12852#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12853#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:46,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {12853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12853#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:46,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {12853#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12854#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:46,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {12854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12854#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:46,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {12854#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12855#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:46,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {12855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12855#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:46,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {12855#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12856#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:46,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {12856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12856#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:46,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {12856#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12857#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:46,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {12857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12857#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:46,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {12857#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12858#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:46,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {12858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12858#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:46,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {12858#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12859#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:46,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {12859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12859#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:46,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {12859#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12860#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:46,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {12860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12860#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:46,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {12860#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12861#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:46,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {12861#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12861#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:46,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {12861#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12862#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:46,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {12862#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12862#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:46,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {12862#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12863#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:46,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {12863#(<= main_~a~0 15)} assume !(~a~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {12847#false} havoc ~i~0;~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,717 INFO L273 TraceCheckUtils]: 46: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,718 INFO L273 TraceCheckUtils]: 50: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:46,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:46,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 57: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 65: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 66: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 67: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 68: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 70: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 74: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 75: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 76: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 83: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 84: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 85: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 102: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 103: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 104: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 105: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 106: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 107: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 108: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,724 INFO L273 TraceCheckUtils]: 109: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 110: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 111: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 112: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 115: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 116: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 117: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,725 INFO L273 TraceCheckUtils]: 118: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 119: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 120: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 121: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 122: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 123: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 124: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 125: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:46,726 INFO L273 TraceCheckUtils]: 126: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 127: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 128: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 129: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 130: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 131: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 132: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 133: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 134: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,727 INFO L273 TraceCheckUtils]: 135: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 136: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 137: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 138: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 139: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 140: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 141: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 142: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 143: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:46,728 INFO L273 TraceCheckUtils]: 144: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:46,729 INFO L273 TraceCheckUtils]: 145: Hoare triple {12847#false} havoc ~x~0;~x~0 := 0; {12847#false} is VALID [2018-11-23 12:00:46,729 INFO L273 TraceCheckUtils]: 146: Hoare triple {12847#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {12847#false} is VALID [2018-11-23 12:00:46,729 INFO L256 TraceCheckUtils]: 147: Hoare triple {12847#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {12847#false} is VALID [2018-11-23 12:00:46,729 INFO L273 TraceCheckUtils]: 148: Hoare triple {12847#false} ~cond := #in~cond; {12847#false} is VALID [2018-11-23 12:00:46,729 INFO L273 TraceCheckUtils]: 149: Hoare triple {12847#false} assume 0 == ~cond; {12847#false} is VALID [2018-11-23 12:00:46,729 INFO L273 TraceCheckUtils]: 150: Hoare triple {12847#false} assume !false; {12847#false} is VALID [2018-11-23 12:00:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:00:46,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:46,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:46,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:46,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:46,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:46,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:47,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {12846#true} call ULTIMATE.init(); {12846#true} is VALID [2018-11-23 12:00:47,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {12846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12846#true} is VALID [2018-11-23 12:00:47,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {12846#true} assume true; {12846#true} is VALID [2018-11-23 12:00:47,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12846#true} {12846#true} #133#return; {12846#true} is VALID [2018-11-23 12:00:47,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {12846#true} call #t~ret17 := main(); {12846#true} is VALID [2018-11-23 12:00:47,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {12846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12882#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:47,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {12882#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12882#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:47,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {12882#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12849#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:47,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {12849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12849#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:47,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {12849#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12850#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:47,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {12850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12850#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:47,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {12850#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12851#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:47,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {12851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12851#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:47,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {12851#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12852#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:47,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {12852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12852#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:47,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {12852#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12853#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:47,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {12853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12853#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:47,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {12853#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12854#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:47,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {12854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12854#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:47,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {12854#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12855#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:47,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {12855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12855#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:47,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {12855#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12856#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:47,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {12856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12856#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:47,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {12856#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12857#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:47,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {12857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12857#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:47,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {12857#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12858#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:47,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {12858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12858#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:47,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {12858#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12859#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {12859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12859#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {12859#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12860#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:47,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {12860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12860#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:47,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {12860#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12861#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:47,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {12861#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12861#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:47,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {12861#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12862#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:47,154 INFO L273 TraceCheckUtils]: 34: Hoare triple {12862#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12862#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:47,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {12862#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12863#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {12863#(<= main_~a~0 15)} assume !(~a~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {12847#false} havoc ~i~0;~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 38: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 39: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 40: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 41: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 43: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 45: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 46: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 47: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 49: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 50: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 51: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 52: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12847#false} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {12847#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12847#false} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 58: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 60: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 61: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 65: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 66: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 67: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 68: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 69: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 70: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12847#false} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 71: Hoare triple {12847#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12847#false} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 72: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 74: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 75: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 76: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 77: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 78: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 79: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 80: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 81: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 82: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 83: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 84: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 85: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 86: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 87: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 88: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {12847#false} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 89: Hoare triple {12847#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12847#false} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 90: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 91: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 92: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 93: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 94: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 95: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 96: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 97: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 98: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 99: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 100: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 101: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 102: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 103: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 104: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 105: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 106: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {12847#false} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 107: Hoare triple {12847#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {12847#false} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 108: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 109: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 110: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 111: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 112: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 113: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 114: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 115: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 116: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 117: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 118: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 119: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 120: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 121: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 122: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 123: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 124: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {12847#false} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 125: Hoare triple {12847#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12847#false} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 126: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 127: Hoare triple {12847#false} ~i~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 128: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 129: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 130: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 131: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 132: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 133: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 134: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 135: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 136: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 137: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 138: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 139: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 140: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 141: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 142: Hoare triple {12847#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {12847#false} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 143: Hoare triple {12847#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {12847#false} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 144: Hoare triple {12847#false} assume !(~i~0 < 100000); {12847#false} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 145: Hoare triple {12847#false} havoc ~x~0;~x~0 := 0; {12847#false} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 146: Hoare triple {12847#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {12847#false} is VALID [2018-11-23 12:00:47,175 INFO L256 TraceCheckUtils]: 147: Hoare triple {12847#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {12847#false} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 148: Hoare triple {12847#false} ~cond := #in~cond; {12847#false} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 149: Hoare triple {12847#false} assume 0 == ~cond; {12847#false} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 150: Hoare triple {12847#false} assume !false; {12847#false} is VALID [2018-11-23 12:00:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:00:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:00:47,209 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 151 [2018-11-23 12:00:47,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:47,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:00:47,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:47,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:00:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:00:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:00:47,302 INFO L87 Difference]: Start difference. First operand 156 states and 163 transitions. Second operand 19 states. [2018-11-23 12:00:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:48,314 INFO L93 Difference]: Finished difference Result 278 states and 292 transitions. [2018-11-23 12:00:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:00:48,315 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 151 [2018-11-23 12:00:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:00:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 112 transitions. [2018-11-23 12:00:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:00:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 112 transitions. [2018-11-23 12:00:48,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 112 transitions. [2018-11-23 12:00:48,493 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 12:00:48,496 INFO L225 Difference]: With dead ends: 278 [2018-11-23 12:00:48,496 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 12:00:48,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:00:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 12:00:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-11-23 12:00:48,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:48,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 158 states. [2018-11-23 12:00:48,608 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 158 states. [2018-11-23 12:00:48,608 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 158 states. [2018-11-23 12:00:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:48,610 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-11-23 12:00:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-11-23 12:00:48,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:48,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:48,611 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 159 states. [2018-11-23 12:00:48,611 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 159 states. [2018-11-23 12:00:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:48,614 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-11-23 12:00:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-11-23 12:00:48,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:48,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:48,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:48,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 12:00:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-11-23 12:00:48,618 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 151 [2018-11-23 12:00:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:48,618 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-11-23 12:00:48,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:00:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-11-23 12:00:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 12:00:48,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:48,620 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:48,620 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:48,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash 429649898, now seen corresponding path program 15 times [2018-11-23 12:00:48,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:48,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:48,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:48,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:49,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {14284#true} call ULTIMATE.init(); {14284#true} is VALID [2018-11-23 12:00:49,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {14284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14284#true} is VALID [2018-11-23 12:00:49,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {14284#true} assume true; {14284#true} is VALID [2018-11-23 12:00:49,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14284#true} {14284#true} #133#return; {14284#true} is VALID [2018-11-23 12:00:49,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {14284#true} call #t~ret17 := main(); {14284#true} is VALID [2018-11-23 12:00:49,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {14284#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14286#(= main_~a~0 0)} is VALID [2018-11-23 12:00:49,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {14286#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14286#(= main_~a~0 0)} is VALID [2018-11-23 12:00:49,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {14286#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14287#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:49,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {14287#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14287#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:49,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {14287#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14288#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:49,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {14288#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14288#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:49,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {14288#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14289#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:49,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {14289#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14289#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:49,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {14289#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14290#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:49,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {14290#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14290#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:49,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {14290#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14291#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:49,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {14291#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14291#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:49,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {14291#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14292#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:49,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {14292#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14292#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:49,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {14292#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14293#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:49,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {14293#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14293#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:49,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {14293#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14294#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:49,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {14294#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14294#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:49,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {14294#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14295#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:49,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {14295#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14295#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:49,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {14295#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14296#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:49,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {14296#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14296#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:49,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {14296#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14297#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:49,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {14297#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14297#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:49,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {14297#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14298#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:49,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {14298#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14298#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:49,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {14298#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14299#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:49,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {14299#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14299#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:49,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {14299#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14300#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:49,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {14300#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14300#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:49,450 INFO L273 TraceCheckUtils]: 35: Hoare triple {14300#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14301#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:49,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {14301#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14301#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:49,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {14301#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14302#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:49,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {14302#(<= main_~a~0 16)} assume !(~a~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {14285#false} havoc ~i~0;~i~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,454 INFO L273 TraceCheckUtils]: 49: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,455 INFO L273 TraceCheckUtils]: 51: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,455 INFO L273 TraceCheckUtils]: 52: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14285#false} is VALID [2018-11-23 12:00:49,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {14285#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 58: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 61: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,456 INFO L273 TraceCheckUtils]: 62: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,457 INFO L273 TraceCheckUtils]: 63: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,457 INFO L273 TraceCheckUtils]: 64: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,457 INFO L273 TraceCheckUtils]: 65: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,457 INFO L273 TraceCheckUtils]: 66: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,457 INFO L273 TraceCheckUtils]: 67: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,457 INFO L273 TraceCheckUtils]: 68: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,458 INFO L273 TraceCheckUtils]: 69: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,458 INFO L273 TraceCheckUtils]: 70: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,458 INFO L273 TraceCheckUtils]: 71: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14285#false} is VALID [2018-11-23 12:00:49,458 INFO L273 TraceCheckUtils]: 73: Hoare triple {14285#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14285#false} is VALID [2018-11-23 12:00:49,458 INFO L273 TraceCheckUtils]: 74: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,459 INFO L273 TraceCheckUtils]: 75: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,459 INFO L273 TraceCheckUtils]: 76: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,459 INFO L273 TraceCheckUtils]: 77: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,459 INFO L273 TraceCheckUtils]: 78: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,459 INFO L273 TraceCheckUtils]: 79: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,460 INFO L273 TraceCheckUtils]: 80: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,460 INFO L273 TraceCheckUtils]: 81: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,460 INFO L273 TraceCheckUtils]: 82: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,460 INFO L273 TraceCheckUtils]: 83: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,460 INFO L273 TraceCheckUtils]: 84: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,460 INFO L273 TraceCheckUtils]: 85: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,461 INFO L273 TraceCheckUtils]: 86: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,461 INFO L273 TraceCheckUtils]: 87: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,461 INFO L273 TraceCheckUtils]: 88: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,461 INFO L273 TraceCheckUtils]: 89: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,461 INFO L273 TraceCheckUtils]: 90: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:00:49,461 INFO L273 TraceCheckUtils]: 91: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:00:49,462 INFO L273 TraceCheckUtils]: 92: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,462 INFO L273 TraceCheckUtils]: 93: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,462 INFO L273 TraceCheckUtils]: 94: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,462 INFO L273 TraceCheckUtils]: 95: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,462 INFO L273 TraceCheckUtils]: 96: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,462 INFO L273 TraceCheckUtils]: 97: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,463 INFO L273 TraceCheckUtils]: 98: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,463 INFO L273 TraceCheckUtils]: 99: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,463 INFO L273 TraceCheckUtils]: 100: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,463 INFO L273 TraceCheckUtils]: 101: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,463 INFO L273 TraceCheckUtils]: 102: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,463 INFO L273 TraceCheckUtils]: 103: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,464 INFO L273 TraceCheckUtils]: 104: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,464 INFO L273 TraceCheckUtils]: 105: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,464 INFO L273 TraceCheckUtils]: 106: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,464 INFO L273 TraceCheckUtils]: 107: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,464 INFO L273 TraceCheckUtils]: 108: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:00:49,465 INFO L273 TraceCheckUtils]: 109: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:00:49,465 INFO L273 TraceCheckUtils]: 110: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,465 INFO L273 TraceCheckUtils]: 111: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,465 INFO L273 TraceCheckUtils]: 112: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,465 INFO L273 TraceCheckUtils]: 113: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,465 INFO L273 TraceCheckUtils]: 114: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,466 INFO L273 TraceCheckUtils]: 115: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,466 INFO L273 TraceCheckUtils]: 116: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,466 INFO L273 TraceCheckUtils]: 117: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,466 INFO L273 TraceCheckUtils]: 118: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,466 INFO L273 TraceCheckUtils]: 119: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,466 INFO L273 TraceCheckUtils]: 120: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,467 INFO L273 TraceCheckUtils]: 121: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,467 INFO L273 TraceCheckUtils]: 122: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,467 INFO L273 TraceCheckUtils]: 123: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,467 INFO L273 TraceCheckUtils]: 124: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,467 INFO L273 TraceCheckUtils]: 125: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,467 INFO L273 TraceCheckUtils]: 126: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 127: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 128: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 129: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 130: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 131: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 132: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,468 INFO L273 TraceCheckUtils]: 133: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,469 INFO L273 TraceCheckUtils]: 134: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,469 INFO L273 TraceCheckUtils]: 135: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,469 INFO L273 TraceCheckUtils]: 136: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,469 INFO L273 TraceCheckUtils]: 137: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,469 INFO L273 TraceCheckUtils]: 138: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,469 INFO L273 TraceCheckUtils]: 139: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,470 INFO L273 TraceCheckUtils]: 140: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,470 INFO L273 TraceCheckUtils]: 141: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,470 INFO L273 TraceCheckUtils]: 142: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,470 INFO L273 TraceCheckUtils]: 143: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,470 INFO L273 TraceCheckUtils]: 144: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:00:49,471 INFO L273 TraceCheckUtils]: 145: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:00:49,471 INFO L273 TraceCheckUtils]: 146: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:00:49,471 INFO L273 TraceCheckUtils]: 147: Hoare triple {14285#false} havoc ~x~0;~x~0 := 0; {14285#false} is VALID [2018-11-23 12:00:49,471 INFO L273 TraceCheckUtils]: 148: Hoare triple {14285#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {14285#false} is VALID [2018-11-23 12:00:49,471 INFO L256 TraceCheckUtils]: 149: Hoare triple {14285#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {14285#false} is VALID [2018-11-23 12:00:49,471 INFO L273 TraceCheckUtils]: 150: Hoare triple {14285#false} ~cond := #in~cond; {14285#false} is VALID [2018-11-23 12:00:49,472 INFO L273 TraceCheckUtils]: 151: Hoare triple {14285#false} assume 0 == ~cond; {14285#false} is VALID [2018-11-23 12:00:49,472 INFO L273 TraceCheckUtils]: 152: Hoare triple {14285#false} assume !false; {14285#false} is VALID [2018-11-23 12:00:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:00:49,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:49,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:12,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:01:12,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:12,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:12,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {14284#true} call ULTIMATE.init(); {14284#true} is VALID [2018-11-23 12:01:12,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {14284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14284#true} is VALID [2018-11-23 12:01:12,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {14284#true} assume true; {14284#true} is VALID [2018-11-23 12:01:12,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14284#true} {14284#true} #133#return; {14284#true} is VALID [2018-11-23 12:01:12,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {14284#true} call #t~ret17 := main(); {14284#true} is VALID [2018-11-23 12:01:12,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {14284#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14284#true} is VALID [2018-11-23 12:01:12,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14284#true} is VALID [2018-11-23 12:01:12,840 INFO L273 TraceCheckUtils]: 35: Hoare triple {14284#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14284#true} is VALID [2018-11-23 12:01:12,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {14284#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14414#(< main_~a~0 100000)} is VALID [2018-11-23 12:01:12,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {14414#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14418#(<= main_~a~0 100000)} is VALID [2018-11-23 12:01:12,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {14418#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {14284#true} havoc ~i~0;~i~0 := 0; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 48: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 50: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 51: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 52: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14284#true} is VALID [2018-11-23 12:01:12,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {14284#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14284#true} is VALID [2018-11-23 12:01:12,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {14284#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14470#(< main_~i~0 100000)} is VALID [2018-11-23 12:01:12,844 INFO L273 TraceCheckUtils]: 55: Hoare triple {14470#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14474#(<= main_~i~0 100000)} is VALID [2018-11-23 12:01:12,844 INFO L273 TraceCheckUtils]: 56: Hoare triple {14474#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {14284#true} is VALID [2018-11-23 12:01:12,845 INFO L273 TraceCheckUtils]: 57: Hoare triple {14284#true} ~i~0 := 0; {14481#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:12,845 INFO L273 TraceCheckUtils]: 58: Hoare triple {14481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14481#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:12,845 INFO L273 TraceCheckUtils]: 59: Hoare triple {14481#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14488#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,846 INFO L273 TraceCheckUtils]: 60: Hoare triple {14488#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14488#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:12,846 INFO L273 TraceCheckUtils]: 61: Hoare triple {14488#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14495#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,846 INFO L273 TraceCheckUtils]: 62: Hoare triple {14495#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14495#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:12,847 INFO L273 TraceCheckUtils]: 63: Hoare triple {14495#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14502#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,847 INFO L273 TraceCheckUtils]: 64: Hoare triple {14502#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14502#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:12,848 INFO L273 TraceCheckUtils]: 65: Hoare triple {14502#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14509#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {14509#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14509#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:12,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {14509#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14516#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,850 INFO L273 TraceCheckUtils]: 68: Hoare triple {14516#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14516#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:12,850 INFO L273 TraceCheckUtils]: 69: Hoare triple {14516#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14523#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,851 INFO L273 TraceCheckUtils]: 70: Hoare triple {14523#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14523#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:12,852 INFO L273 TraceCheckUtils]: 71: Hoare triple {14523#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14530#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,852 INFO L273 TraceCheckUtils]: 72: Hoare triple {14530#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14530#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:12,853 INFO L273 TraceCheckUtils]: 73: Hoare triple {14530#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14537#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:12,853 INFO L273 TraceCheckUtils]: 74: Hoare triple {14537#(<= main_~i~0 8)} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:01:12,854 INFO L273 TraceCheckUtils]: 75: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:01:12,854 INFO L273 TraceCheckUtils]: 76: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,854 INFO L273 TraceCheckUtils]: 77: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,854 INFO L273 TraceCheckUtils]: 78: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,854 INFO L273 TraceCheckUtils]: 79: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,855 INFO L273 TraceCheckUtils]: 80: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,855 INFO L273 TraceCheckUtils]: 81: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,855 INFO L273 TraceCheckUtils]: 82: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,855 INFO L273 TraceCheckUtils]: 83: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,855 INFO L273 TraceCheckUtils]: 84: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,856 INFO L273 TraceCheckUtils]: 85: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,856 INFO L273 TraceCheckUtils]: 86: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,856 INFO L273 TraceCheckUtils]: 87: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,856 INFO L273 TraceCheckUtils]: 88: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,856 INFO L273 TraceCheckUtils]: 89: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,857 INFO L273 TraceCheckUtils]: 90: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {14285#false} is VALID [2018-11-23 12:01:12,857 INFO L273 TraceCheckUtils]: 91: Hoare triple {14285#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14285#false} is VALID [2018-11-23 12:01:12,857 INFO L273 TraceCheckUtils]: 92: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:01:12,857 INFO L273 TraceCheckUtils]: 93: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:01:12,857 INFO L273 TraceCheckUtils]: 94: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 95: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 96: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 97: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 98: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 99: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 100: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 101: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 102: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,858 INFO L273 TraceCheckUtils]: 103: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 104: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 105: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 106: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 107: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 108: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 109: Hoare triple {14285#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 110: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 111: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:01:12,859 INFO L273 TraceCheckUtils]: 112: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 113: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 114: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 115: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 116: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 117: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 118: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 119: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 120: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,860 INFO L273 TraceCheckUtils]: 121: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 122: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 123: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 124: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 125: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 126: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 127: Hoare triple {14285#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 128: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 129: Hoare triple {14285#false} ~i~0 := 0; {14285#false} is VALID [2018-11-23 12:01:12,861 INFO L273 TraceCheckUtils]: 130: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 131: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 132: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 133: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 134: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 135: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 136: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 137: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 138: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,862 INFO L273 TraceCheckUtils]: 139: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 140: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 141: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 142: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 143: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 144: Hoare triple {14285#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 145: Hoare triple {14285#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 146: Hoare triple {14285#false} assume !(~i~0 < 100000); {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 147: Hoare triple {14285#false} havoc ~x~0;~x~0 := 0; {14285#false} is VALID [2018-11-23 12:01:12,863 INFO L273 TraceCheckUtils]: 148: Hoare triple {14285#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {14285#false} is VALID [2018-11-23 12:01:12,864 INFO L256 TraceCheckUtils]: 149: Hoare triple {14285#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {14285#false} is VALID [2018-11-23 12:01:12,864 INFO L273 TraceCheckUtils]: 150: Hoare triple {14285#false} ~cond := #in~cond; {14285#false} is VALID [2018-11-23 12:01:12,864 INFO L273 TraceCheckUtils]: 151: Hoare triple {14285#false} assume 0 == ~cond; {14285#false} is VALID [2018-11-23 12:01:12,864 INFO L273 TraceCheckUtils]: 152: Hoare triple {14285#false} assume !false; {14285#false} is VALID [2018-11-23 12:01:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 46 proven. 64 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-11-23 12:01:12,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:12,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2018-11-23 12:01:12,899 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 153 [2018-11-23 12:01:12,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:12,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:01:12,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:12,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:01:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:01:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:01:12,997 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 32 states. [2018-11-23 12:01:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,985 INFO L93 Difference]: Finished difference Result 305 states and 332 transitions. [2018-11-23 12:01:14,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:01:14,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 153 [2018-11-23 12:01:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 242 transitions. [2018-11-23 12:01:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 242 transitions. [2018-11-23 12:01:14,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 242 transitions. [2018-11-23 12:01:15,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:15,809 INFO L225 Difference]: With dead ends: 305 [2018-11-23 12:01:15,809 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 12:01:15,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=441, Invalid=1365, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:01:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 12:01:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-11-23 12:01:16,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:16,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 186 states. [2018-11-23 12:01:16,144 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 186 states. [2018-11-23 12:01:16,144 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 186 states. [2018-11-23 12:01:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:16,149 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2018-11-23 12:01:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-23 12:01:16,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:16,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:16,150 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 186 states. [2018-11-23 12:01:16,151 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 186 states. [2018-11-23 12:01:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:16,155 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2018-11-23 12:01:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-23 12:01:16,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:16,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:16,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:16,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 12:01:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 193 transitions. [2018-11-23 12:01:16,160 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 193 transitions. Word has length 153 [2018-11-23 12:01:16,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:16,161 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 193 transitions. [2018-11-23 12:01:16,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:01:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-23 12:01:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 12:01:16,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:16,163 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:16,163 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:16,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:16,163 INFO L82 PathProgramCache]: Analyzing trace with hash -296900978, now seen corresponding path program 16 times [2018-11-23 12:01:16,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:16,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:16,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:16,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {15911#true} call ULTIMATE.init(); {15911#true} is VALID [2018-11-23 12:01:17,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {15911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15911#true} is VALID [2018-11-23 12:01:17,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {15911#true} assume true; {15911#true} is VALID [2018-11-23 12:01:17,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15911#true} {15911#true} #133#return; {15911#true} is VALID [2018-11-23 12:01:17,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {15911#true} call #t~ret17 := main(); {15911#true} is VALID [2018-11-23 12:01:17,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {15911#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15913#(= main_~a~0 0)} is VALID [2018-11-23 12:01:17,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {15913#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15913#(= main_~a~0 0)} is VALID [2018-11-23 12:01:17,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {15913#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15914#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:17,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {15914#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15914#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:17,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {15914#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15915#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:17,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {15915#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15915#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:17,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {15915#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15916#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:17,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {15916#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15916#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:17,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {15916#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15917#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:17,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {15917#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15917#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:17,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {15917#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15918#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:17,041 INFO L273 TraceCheckUtils]: 16: Hoare triple {15918#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15918#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:17,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {15918#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15919#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:17,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {15919#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15919#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:17,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {15919#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15920#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:17,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {15920#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15920#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:17,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {15920#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15921#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:17,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {15921#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15921#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:17,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {15921#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15922#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:17,046 INFO L273 TraceCheckUtils]: 24: Hoare triple {15922#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15922#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:17,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {15922#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15923#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:17,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {15923#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15923#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:17,048 INFO L273 TraceCheckUtils]: 27: Hoare triple {15923#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15924#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:17,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {15924#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15924#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:17,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {15924#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15925#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:17,050 INFO L273 TraceCheckUtils]: 30: Hoare triple {15925#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15925#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:17,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {15925#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15926#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:17,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {15926#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15926#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:17,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {15926#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15927#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:17,053 INFO L273 TraceCheckUtils]: 34: Hoare triple {15927#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15927#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:17,053 INFO L273 TraceCheckUtils]: 35: Hoare triple {15927#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15928#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:17,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {15928#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15928#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:17,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {15928#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15929#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:17,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {15929#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15929#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:17,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {15929#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15930#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:17,057 INFO L273 TraceCheckUtils]: 40: Hoare triple {15930#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15930#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:17,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {15930#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15931#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:17,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {15931#(<= main_~a~0 18)} assume !(~a~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {15912#false} havoc ~i~0;~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,059 INFO L273 TraceCheckUtils]: 45: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,059 INFO L273 TraceCheckUtils]: 50: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,060 INFO L273 TraceCheckUtils]: 51: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,060 INFO L273 TraceCheckUtils]: 52: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,060 INFO L273 TraceCheckUtils]: 53: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,060 INFO L273 TraceCheckUtils]: 54: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,061 INFO L273 TraceCheckUtils]: 56: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,061 INFO L273 TraceCheckUtils]: 57: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,061 INFO L273 TraceCheckUtils]: 58: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,061 INFO L273 TraceCheckUtils]: 59: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 61: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 62: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 63: Hoare triple {15912#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 65: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 66: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 67: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 68: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,062 INFO L273 TraceCheckUtils]: 69: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 70: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 71: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 72: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 73: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 74: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 75: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 76: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 77: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,063 INFO L273 TraceCheckUtils]: 78: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 79: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 80: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 81: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 82: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 83: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 84: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 85: Hoare triple {15912#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 86: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,064 INFO L273 TraceCheckUtils]: 87: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 88: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 89: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 90: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 91: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 92: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 93: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 94: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 95: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,065 INFO L273 TraceCheckUtils]: 96: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 97: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 98: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 99: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 100: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 101: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 102: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 103: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 104: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,066 INFO L273 TraceCheckUtils]: 105: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 106: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 107: Hoare triple {15912#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 108: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 109: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 110: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 111: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 112: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 113: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,067 INFO L273 TraceCheckUtils]: 114: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 115: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 116: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 117: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 118: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 119: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 120: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 121: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 122: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,068 INFO L273 TraceCheckUtils]: 123: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 124: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 125: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 126: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 127: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 128: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 129: Hoare triple {15912#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 130: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 131: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,069 INFO L273 TraceCheckUtils]: 132: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 133: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 134: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 135: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 136: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 137: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 138: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 139: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 140: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,070 INFO L273 TraceCheckUtils]: 141: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 142: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 143: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 144: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 145: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 146: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 147: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 148: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,071 INFO L273 TraceCheckUtils]: 149: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 150: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 151: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 152: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 153: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 154: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 155: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 156: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 157: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,072 INFO L273 TraceCheckUtils]: 158: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 159: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 160: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 161: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 162: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 163: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 164: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 165: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 166: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,073 INFO L273 TraceCheckUtils]: 167: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 168: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 169: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 170: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 171: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 172: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 173: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 174: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 175: Hoare triple {15912#false} havoc ~x~0;~x~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,074 INFO L273 TraceCheckUtils]: 176: Hoare triple {15912#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {15912#false} is VALID [2018-11-23 12:01:17,075 INFO L256 TraceCheckUtils]: 177: Hoare triple {15912#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {15912#false} is VALID [2018-11-23 12:01:17,075 INFO L273 TraceCheckUtils]: 178: Hoare triple {15912#false} ~cond := #in~cond; {15912#false} is VALID [2018-11-23 12:01:17,075 INFO L273 TraceCheckUtils]: 179: Hoare triple {15912#false} assume 0 == ~cond; {15912#false} is VALID [2018-11-23 12:01:17,075 INFO L273 TraceCheckUtils]: 180: Hoare triple {15912#false} assume !false; {15912#false} is VALID [2018-11-23 12:01:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-23 12:01:17,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:17,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:17,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:17,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:17,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:17,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {15911#true} call ULTIMATE.init(); {15911#true} is VALID [2018-11-23 12:01:17,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {15911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {15911#true} assume true; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15911#true} {15911#true} #133#return; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {15911#true} call #t~ret17 := main(); {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {15911#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 22: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 30: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 31: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {15911#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15911#true} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {15911#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15911#true} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {15911#true} assume !(~a~0 < 100000); {15911#true} is VALID [2018-11-23 12:01:17,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {15911#true} havoc ~i~0;~i~0 := 0; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 47: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 48: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 49: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 51: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 55: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 56: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 57: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 58: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,580 INFO L273 TraceCheckUtils]: 59: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 60: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 61: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 62: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 63: Hoare triple {15911#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 64: Hoare triple {15911#true} assume !(~i~0 < 100000); {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 65: Hoare triple {15911#true} ~i~0 := 0; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 66: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 67: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,581 INFO L273 TraceCheckUtils]: 68: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 69: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 70: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 71: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 72: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 73: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 78: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 79: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 80: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 81: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 82: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 83: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 84: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 85: Hoare triple {15911#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15911#true} is VALID [2018-11-23 12:01:17,583 INFO L273 TraceCheckUtils]: 86: Hoare triple {15911#true} assume !(~i~0 < 100000); {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 87: Hoare triple {15911#true} ~i~0 := 0; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 88: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 89: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 90: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 91: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 92: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 93: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,584 INFO L273 TraceCheckUtils]: 95: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 96: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 97: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 98: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 99: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 100: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 101: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 102: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 103: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,585 INFO L273 TraceCheckUtils]: 104: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 105: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 106: Hoare triple {15911#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15911#true} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 107: Hoare triple {15911#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15911#true} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 108: Hoare triple {15911#true} assume !(~i~0 < 100000); {15911#true} is VALID [2018-11-23 12:01:17,586 INFO L273 TraceCheckUtils]: 109: Hoare triple {15911#true} ~i~0 := 0; {16262#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,587 INFO L273 TraceCheckUtils]: 110: Hoare triple {16262#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16262#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,587 INFO L273 TraceCheckUtils]: 111: Hoare triple {16262#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16269#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,588 INFO L273 TraceCheckUtils]: 112: Hoare triple {16269#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16269#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,588 INFO L273 TraceCheckUtils]: 113: Hoare triple {16269#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16276#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,609 INFO L273 TraceCheckUtils]: 114: Hoare triple {16276#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16276#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:17,623 INFO L273 TraceCheckUtils]: 115: Hoare triple {16276#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16283#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,632 INFO L273 TraceCheckUtils]: 116: Hoare triple {16283#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16283#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:17,646 INFO L273 TraceCheckUtils]: 117: Hoare triple {16283#(<= main_~i~0 3)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16290#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,660 INFO L273 TraceCheckUtils]: 118: Hoare triple {16290#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16290#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:17,669 INFO L273 TraceCheckUtils]: 119: Hoare triple {16290#(<= main_~i~0 4)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16297#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,682 INFO L273 TraceCheckUtils]: 120: Hoare triple {16297#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16297#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:17,691 INFO L273 TraceCheckUtils]: 121: Hoare triple {16297#(<= main_~i~0 5)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16304#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,705 INFO L273 TraceCheckUtils]: 122: Hoare triple {16304#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16304#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:17,714 INFO L273 TraceCheckUtils]: 123: Hoare triple {16304#(<= main_~i~0 6)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16311#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,726 INFO L273 TraceCheckUtils]: 124: Hoare triple {16311#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16311#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:17,739 INFO L273 TraceCheckUtils]: 125: Hoare triple {16311#(<= main_~i~0 7)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16318#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,752 INFO L273 TraceCheckUtils]: 126: Hoare triple {16318#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16318#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:17,765 INFO L273 TraceCheckUtils]: 127: Hoare triple {16318#(<= main_~i~0 8)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16325#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,777 INFO L273 TraceCheckUtils]: 128: Hoare triple {16325#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {16325#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:17,790 INFO L273 TraceCheckUtils]: 129: Hoare triple {16325#(<= main_~i~0 9)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16332#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:17,803 INFO L273 TraceCheckUtils]: 130: Hoare triple {16332#(<= main_~i~0 10)} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,803 INFO L273 TraceCheckUtils]: 131: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,803 INFO L273 TraceCheckUtils]: 132: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,803 INFO L273 TraceCheckUtils]: 133: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,803 INFO L273 TraceCheckUtils]: 134: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,804 INFO L273 TraceCheckUtils]: 135: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,804 INFO L273 TraceCheckUtils]: 136: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,804 INFO L273 TraceCheckUtils]: 137: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,804 INFO L273 TraceCheckUtils]: 138: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,804 INFO L273 TraceCheckUtils]: 139: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 140: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 141: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 142: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 143: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 144: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 145: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,805 INFO L273 TraceCheckUtils]: 146: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,806 INFO L273 TraceCheckUtils]: 147: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,806 INFO L273 TraceCheckUtils]: 148: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,806 INFO L273 TraceCheckUtils]: 149: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,806 INFO L273 TraceCheckUtils]: 150: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15912#false} is VALID [2018-11-23 12:01:17,806 INFO L273 TraceCheckUtils]: 151: Hoare triple {15912#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15912#false} is VALID [2018-11-23 12:01:17,806 INFO L273 TraceCheckUtils]: 152: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,807 INFO L273 TraceCheckUtils]: 153: Hoare triple {15912#false} ~i~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,807 INFO L273 TraceCheckUtils]: 154: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,807 INFO L273 TraceCheckUtils]: 155: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,807 INFO L273 TraceCheckUtils]: 156: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,807 INFO L273 TraceCheckUtils]: 157: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,807 INFO L273 TraceCheckUtils]: 158: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,808 INFO L273 TraceCheckUtils]: 159: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,808 INFO L273 TraceCheckUtils]: 160: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,808 INFO L273 TraceCheckUtils]: 161: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,808 INFO L273 TraceCheckUtils]: 162: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,808 INFO L273 TraceCheckUtils]: 163: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,808 INFO L273 TraceCheckUtils]: 164: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,809 INFO L273 TraceCheckUtils]: 165: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,809 INFO L273 TraceCheckUtils]: 166: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,809 INFO L273 TraceCheckUtils]: 167: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,809 INFO L273 TraceCheckUtils]: 168: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,809 INFO L273 TraceCheckUtils]: 169: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,809 INFO L273 TraceCheckUtils]: 170: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,810 INFO L273 TraceCheckUtils]: 171: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,810 INFO L273 TraceCheckUtils]: 172: Hoare triple {15912#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15912#false} is VALID [2018-11-23 12:01:17,810 INFO L273 TraceCheckUtils]: 173: Hoare triple {15912#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15912#false} is VALID [2018-11-23 12:01:17,810 INFO L273 TraceCheckUtils]: 174: Hoare triple {15912#false} assume !(~i~0 < 100000); {15912#false} is VALID [2018-11-23 12:01:17,810 INFO L273 TraceCheckUtils]: 175: Hoare triple {15912#false} havoc ~x~0;~x~0 := 0; {15912#false} is VALID [2018-11-23 12:01:17,810 INFO L273 TraceCheckUtils]: 176: Hoare triple {15912#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {15912#false} is VALID [2018-11-23 12:01:17,811 INFO L256 TraceCheckUtils]: 177: Hoare triple {15912#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {15912#false} is VALID [2018-11-23 12:01:17,811 INFO L273 TraceCheckUtils]: 178: Hoare triple {15912#false} ~cond := #in~cond; {15912#false} is VALID [2018-11-23 12:01:17,811 INFO L273 TraceCheckUtils]: 179: Hoare triple {15912#false} assume 0 == ~cond; {15912#false} is VALID [2018-11-23 12:01:17,811 INFO L273 TraceCheckUtils]: 180: Hoare triple {15912#false} assume !false; {15912#false} is VALID [2018-11-23 12:01:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2018-11-23 12:01:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:17,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2018-11-23 12:01:17,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 181 [2018-11-23 12:01:17,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:17,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:01:18,002 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 12:01:18,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:01:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:01:18,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:01:18,004 INFO L87 Difference]: Start difference. First operand 186 states and 193 transitions. Second operand 32 states. [2018-11-23 12:01:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:19,843 INFO L93 Difference]: Finished difference Result 350 states and 370 transitions. [2018-11-23 12:01:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:01:19,843 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 181 [2018-11-23 12:01:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 256 transitions. [2018-11-23 12:01:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 256 transitions. [2018-11-23 12:01:19,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 256 transitions. [2018-11-23 12:01:20,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:20,530 INFO L225 Difference]: With dead ends: 350 [2018-11-23 12:01:20,530 INFO L226 Difference]: Without dead ends: 207 [2018-11-23 12:01:20,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:01:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-23 12:01:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-11-23 12:01:20,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:20,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 200 states. [2018-11-23 12:01:20,666 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 200 states. [2018-11-23 12:01:20,666 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 200 states. [2018-11-23 12:01:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:20,671 INFO L93 Difference]: Finished difference Result 207 states and 214 transitions. [2018-11-23 12:01:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 214 transitions. [2018-11-23 12:01:20,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:20,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:20,672 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 207 states. [2018-11-23 12:01:20,672 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 207 states. [2018-11-23 12:01:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:20,677 INFO L93 Difference]: Finished difference Result 207 states and 214 transitions. [2018-11-23 12:01:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 214 transitions. [2018-11-23 12:01:20,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:20,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:20,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:20,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 12:01:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 207 transitions. [2018-11-23 12:01:20,683 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 207 transitions. Word has length 181 [2018-11-23 12:01:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:20,683 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 207 transitions. [2018-11-23 12:01:20,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:01:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 207 transitions. [2018-11-23 12:01:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-23 12:01:20,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:20,685 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:20,685 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:20,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2012559008, now seen corresponding path program 17 times [2018-11-23 12:01:20,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:20,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:20,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:21,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {17716#true} call ULTIMATE.init(); {17716#true} is VALID [2018-11-23 12:01:21,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {17716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17716#true} is VALID [2018-11-23 12:01:21,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {17716#true} assume true; {17716#true} is VALID [2018-11-23 12:01:21,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17716#true} {17716#true} #133#return; {17716#true} is VALID [2018-11-23 12:01:21,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {17716#true} call #t~ret17 := main(); {17716#true} is VALID [2018-11-23 12:01:21,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {17716#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17718#(= main_~a~0 0)} is VALID [2018-11-23 12:01:21,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {17718#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17718#(= main_~a~0 0)} is VALID [2018-11-23 12:01:21,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {17718#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17719#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:21,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {17719#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17719#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:21,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {17719#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17720#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:21,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {17720#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17720#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:21,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {17720#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17721#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:21,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {17721#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17721#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:21,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {17721#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17722#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:21,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {17722#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17722#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:21,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {17722#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17723#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:21,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {17723#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17723#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:21,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {17723#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17724#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:21,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {17724#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17724#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:21,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {17724#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17725#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:21,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {17725#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17725#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:21,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {17725#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17726#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:21,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {17726#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17726#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:21,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {17726#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17727#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:21,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {17727#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17727#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:21,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {17727#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17728#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:21,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {17728#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17728#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:21,514 INFO L273 TraceCheckUtils]: 27: Hoare triple {17728#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17729#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:21,514 INFO L273 TraceCheckUtils]: 28: Hoare triple {17729#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17729#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:21,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {17729#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17730#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:21,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {17730#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17730#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:21,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {17730#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17731#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:21,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {17731#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17731#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:21,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {17731#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17732#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:21,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {17732#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17732#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:21,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {17732#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17733#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:21,519 INFO L273 TraceCheckUtils]: 36: Hoare triple {17733#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17733#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {17733#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17734#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {17734#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17734#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {17734#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17735#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 40: Hoare triple {17735#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17735#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 41: Hoare triple {17735#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17736#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 42: Hoare triple {17736#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17736#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {17736#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17737#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {17737#(<= main_~a~0 19)} assume !(~a~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {17717#false} havoc ~i~0;~i~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 49: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 56: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 60: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 61: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 62: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {17717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 71: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 76: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 80: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 81: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 82: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 83: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 84: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 85: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 87: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 88: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 89: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 90: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 91: Hoare triple {17717#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 92: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 93: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 94: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 95: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 96: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 97: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 98: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 99: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 100: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 101: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 102: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 103: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 104: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 105: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 106: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 107: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 108: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 109: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 110: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 111: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 112: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,533 INFO L273 TraceCheckUtils]: 113: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 114: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 115: Hoare triple {17717#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 116: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 117: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 118: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 119: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 120: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 121: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,534 INFO L273 TraceCheckUtils]: 122: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 123: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 124: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 125: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 126: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 127: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 128: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 129: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 130: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,535 INFO L273 TraceCheckUtils]: 131: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 132: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 133: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 134: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 135: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 136: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 137: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 138: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 139: Hoare triple {17717#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 140: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,536 INFO L273 TraceCheckUtils]: 141: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 142: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 143: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 144: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 145: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 146: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 147: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 148: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 149: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,537 INFO L273 TraceCheckUtils]: 150: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 151: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 152: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 153: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 154: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 155: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 156: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 157: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 158: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,538 INFO L273 TraceCheckUtils]: 159: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 160: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 161: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 162: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 163: Hoare triple {17717#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 164: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 165: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 166: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 167: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 168: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,539 INFO L273 TraceCheckUtils]: 169: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 170: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 171: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 172: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 173: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 174: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 175: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 176: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 177: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,540 INFO L273 TraceCheckUtils]: 178: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 179: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 180: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 181: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 182: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 183: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 184: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 185: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 186: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {17717#false} is VALID [2018-11-23 12:01:21,541 INFO L273 TraceCheckUtils]: 187: Hoare triple {17717#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L273 TraceCheckUtils]: 188: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L273 TraceCheckUtils]: 189: Hoare triple {17717#false} havoc ~x~0;~x~0 := 0; {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L273 TraceCheckUtils]: 190: Hoare triple {17717#false} assume !!(~x~0 < 100000);call #t~mem15 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~x~0, 4); {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L256 TraceCheckUtils]: 191: Hoare triple {17717#false} call __VERIFIER_assert((if #t~mem15 == #t~mem16 then 1 else 0)); {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L273 TraceCheckUtils]: 192: Hoare triple {17717#false} ~cond := #in~cond; {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L273 TraceCheckUtils]: 193: Hoare triple {17717#false} assume 0 == ~cond; {17717#false} is VALID [2018-11-23 12:01:21,542 INFO L273 TraceCheckUtils]: 194: Hoare triple {17717#false} assume !false; {17717#false} is VALID [2018-11-23 12:01:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-23 12:01:21,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:21,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:21,573 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1