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_copyInitSum3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:01:31,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:01:31,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:01:31,830 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:01:31,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:01:31,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:01:31,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:01:31,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:01:31,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:01:31,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:01:31,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:01:31,848 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:01:31,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:01:31,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:01:31,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:01:31,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:01:31,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:01:31,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:01:31,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:01:31,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:01:31,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:01:31,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:01:31,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:01:31,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:01:31,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:01:31,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:01:31,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:01:31,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:01:31,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:01:31,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:01:31,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:01:31,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:01:31,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:01:31,888 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:01:31,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:01:31,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:01:31,892 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:01:31,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:01:31,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:01:31,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:01:31,923 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:01:31,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:01:31,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:01:31,924 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:01:31,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:01:31,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:01:31,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:01:31,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:01:31,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:01:31,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:01:31,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:01:31,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:01:31,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:01:31,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:01:31,928 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:01:31,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:01:31,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:01:31,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:01:31,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:01:31,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:01:31,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:31,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:01:31,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:01:31,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:01:31,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:01:31,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:01:31,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:01:31,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:01:32,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:01:32,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:01:32,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:01:32,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:01:32,023 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:01:32,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum3_true-unreach-call_ground.i [2018-11-23 12:01:32,105 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4825c441f/f57413100fb64874ba7f9ba08f80b0a6/FLAGe3f25b62f [2018-11-23 12:01:32,601 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:01:32,601 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum3_true-unreach-call_ground.i [2018-11-23 12:01:32,608 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4825c441f/f57413100fb64874ba7f9ba08f80b0a6/FLAGe3f25b62f [2018-11-23 12:01:32,947 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4825c441f/f57413100fb64874ba7f9ba08f80b0a6 [2018-11-23 12:01:32,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:01:32,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:01:32,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:32,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:01:32,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:01:32,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:32" (1/1) ... [2018-11-23 12:01:32,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a78dcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:32, skipping insertion in model container [2018-11-23 12:01:32,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:32" (1/1) ... [2018-11-23 12:01:32,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:01:33,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:01:33,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:33,251 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:01:33,289 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:33,316 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:01:33,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33 WrapperNode [2018-11-23 12:01:33,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:33,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:33,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:01:33,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:01:33,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:33,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:01:33,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:01:33,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:01:33,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... [2018-11-23 12:01:33,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:01:33,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:01:33,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:01:33,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:01:33,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:33,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:01:33,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:01:33,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:01:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:01:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:01:33,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:01:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:01:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:01:33,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:01:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:01:33,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:01:33,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:01:34,178 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:01:34,178 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 12:01:34,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:34 BoogieIcfgContainer [2018-11-23 12:01:34,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:01:34,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:01:34,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:01:34,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:01:34,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:32" (1/3) ... [2018-11-23 12:01:34,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd84fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:34, skipping insertion in model container [2018-11-23 12:01:34,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:33" (2/3) ... [2018-11-23 12:01:34,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd84fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:34, skipping insertion in model container [2018-11-23 12:01:34,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:34" (3/3) ... [2018-11-23 12:01:34,189 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum3_true-unreach-call_ground.i [2018-11-23 12:01:34,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:01:34,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:01:34,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:01:34,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:01:34,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:01:34,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:01:34,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:01:34,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:01:34,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:01:34,264 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:01:34,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:01:34,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:01:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:01:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:01:34,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:34,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:34,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:34,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash 656367922, now seen corresponding path program 1 times [2018-11-23 12:01:34,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:34,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:34,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:01:34,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:01:34,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:01:34,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2018-11-23 12:01:34,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret9 := main(); {35#true} is VALID [2018-11-23 12:01:34,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {35#true} is VALID [2018-11-23 12:01:34,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:01:34,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:01:34,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !(~i~0 < 100000); {36#false} is VALID [2018-11-23 12:01:34,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:01:34,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(~i~0 < 100000); {36#false} is VALID [2018-11-23 12:01:34,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:01:34,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} assume !(~i~0 < 100000); {36#false} is VALID [2018-11-23 12:01:34,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} havoc ~x~0;~x~0 := 0; {36#false} is VALID [2018-11-23 12:01:34,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {36#false} is VALID [2018-11-23 12:01:34,469 INFO L256 TraceCheckUtils]: 15: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {36#false} is VALID [2018-11-23 12:01:34,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 12:01:34,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-23 12:01:34,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:01:34,474 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 12:01:34,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:34,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:01:34,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 12:01:34,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:34,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:01:34,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:34,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:01:34,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:01:34,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:34,665 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:01:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:34,967 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2018-11-23 12:01:34,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:01:34,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 12:01:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-23 12:01:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-23 12:01:34,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-23 12:01:35,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:35,291 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:01:35,291 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:01:35,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:01:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:01:35,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:35,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:01:35,348 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:01:35,348 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:01:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:35,353 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:01:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:01:35,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:35,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:35,355 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:01:35,355 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:01:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:35,360 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:01:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:01:35,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:35,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:35,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:35,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:01:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:01:35,366 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2018-11-23 12:01:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:35,367 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:01:35,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:01:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:01:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:01:35,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:35,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:35,369 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:35,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1829979950, now seen corresponding path program 1 times [2018-11-23 12:01:35,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:35,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:35,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:35,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {205#true} is VALID [2018-11-23 12:01:35,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {205#true} is VALID [2018-11-23 12:01:35,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2018-11-23 12:01:35,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #90#return; {205#true} is VALID [2018-11-23 12:01:35,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret9 := main(); {205#true} is VALID [2018-11-23 12:01:35,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {205#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {207#(= main_~i~0 0)} is VALID [2018-11-23 12:01:35,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {207#(= main_~i~0 0)} assume !(~i~0 < 100000); {206#false} is VALID [2018-11-23 12:01:35,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#false} ~i~0 := 0; {206#false} is VALID [2018-11-23 12:01:35,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#false} assume !(~i~0 < 100000); {206#false} is VALID [2018-11-23 12:01:35,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#false} ~i~0 := 0; {206#false} is VALID [2018-11-23 12:01:35,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#false} assume !(~i~0 < 100000); {206#false} is VALID [2018-11-23 12:01:35,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {206#false} ~i~0 := 0; {206#false} is VALID [2018-11-23 12:01:35,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#false} assume !(~i~0 < 100000); {206#false} is VALID [2018-11-23 12:01:35,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#false} havoc ~x~0;~x~0 := 0; {206#false} is VALID [2018-11-23 12:01:35,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {206#false} is VALID [2018-11-23 12:01:35,478 INFO L256 TraceCheckUtils]: 15: Hoare triple {206#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {206#false} is VALID [2018-11-23 12:01:35,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2018-11-23 12:01:35,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {206#false} assume 0 == ~cond; {206#false} is VALID [2018-11-23 12:01:35,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {206#false} assume !false; {206#false} is VALID [2018-11-23 12:01:35,481 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 12:01:35,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:35,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:01:35,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:01:35,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:35,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:01:35,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:35,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:01:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:01:35,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:35,558 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-23 12:01:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:35,852 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:01:35,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:01:35,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:01:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2018-11-23 12:01:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2018-11-23 12:01:35,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2018-11-23 12:01:36,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:36,298 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:01:36,298 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:01:36,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:01:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 12:01:36,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:36,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2018-11-23 12:01:36,326 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2018-11-23 12:01:36,326 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2018-11-23 12:01:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,330 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:01:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:01:36,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:36,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:36,331 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2018-11-23 12:01:36,332 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2018-11-23 12:01:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,335 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:01:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:01:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:36,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:36,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:36,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:01:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:01:36,340 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2018-11-23 12:01:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:36,340 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:01:36,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:01:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:01:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:01:36,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:36,342 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] [2018-11-23 12:01:36,342 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:36,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1442018896, now seen corresponding path program 1 times [2018-11-23 12:01:36,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:36,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:36,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:36,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 12:01:36,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {399#true} is VALID [2018-11-23 12:01:36,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 12:01:36,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #90#return; {399#true} is VALID [2018-11-23 12:01:36,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret9 := main(); {399#true} is VALID [2018-11-23 12:01:36,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {401#(= main_~i~0 0)} is VALID [2018-11-23 12:01:36,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {401#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {402#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:36,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {402#(<= main_~i~0 1)} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {400#false} is VALID [2018-11-23 12:01:36,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {400#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {400#false} is VALID [2018-11-23 12:01:36,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {400#false} is VALID [2018-11-23 12:01:36,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {400#false} is VALID [2018-11-23 12:01:36,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {400#false} is VALID [2018-11-23 12:01:36,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {400#false} is VALID [2018-11-23 12:01:36,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} havoc ~x~0;~x~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {400#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {400#false} is VALID [2018-11-23 12:01:36,535 INFO L256 TraceCheckUtils]: 22: Hoare triple {400#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {400#false} is VALID [2018-11-23 12:01:36,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-23 12:01:36,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume 0 == ~cond; {400#false} is VALID [2018-11-23 12:01:36,537 INFO L273 TraceCheckUtils]: 25: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 12:01:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:01:36,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:36,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:36,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:36,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:36,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 12:01:36,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {399#true} is VALID [2018-11-23 12:01:36,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 12:01:36,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #90#return; {399#true} is VALID [2018-11-23 12:01:36,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret9 := main(); {399#true} is VALID [2018-11-23 12:01:36,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {421#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:36,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {421#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {402#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:36,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {402#(<= main_~i~0 1)} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {400#false} is VALID [2018-11-23 12:01:36,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {400#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {400#false} is VALID [2018-11-23 12:01:36,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {400#false} is VALID [2018-11-23 12:01:36,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {400#false} is VALID [2018-11-23 12:01:36,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {400#false} is VALID [2018-11-23 12:01:36,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {400#false} is VALID [2018-11-23 12:01:36,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-23 12:01:36,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} havoc ~x~0;~x~0 := 0; {400#false} is VALID [2018-11-23 12:01:36,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {400#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {400#false} is VALID [2018-11-23 12:01:36,906 INFO L256 TraceCheckUtils]: 22: Hoare triple {400#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {400#false} is VALID [2018-11-23 12:01:36,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-23 12:01:36,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume 0 == ~cond; {400#false} is VALID [2018-11-23 12:01:36,907 INFO L273 TraceCheckUtils]: 25: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 12:01:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:01:36,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:36,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:01:36,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:01:36,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:36,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:01:37,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:37,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:01:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:01:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:37,002 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2018-11-23 12:01:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:37,510 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-23 12:01:37,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:01:37,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:01:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-23 12:01:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-23 12:01:37,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-23 12:01:37,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:37,720 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:01:37,720 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:01:37,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:01:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 12:01:37,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:37,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 12:01:37,757 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 12:01:37,758 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 12:01:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:37,761 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:01:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:01:37,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:37,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:37,762 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 12:01:37,762 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 12:01:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:37,766 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:01:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:01:37,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:37,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:37,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:37,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:01:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 12:01:37,770 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2018-11-23 12:01:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:37,770 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 12:01:37,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:01:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:01:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:01:37,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:37,772 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:37,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:37,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash 261695650, now seen corresponding path program 2 times [2018-11-23 12:01:37,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:37,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:37,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:37,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:37,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2018-11-23 12:01:37,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {712#true} is VALID [2018-11-23 12:01:37,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-23 12:01:37,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #90#return; {712#true} is VALID [2018-11-23 12:01:37,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret9 := main(); {712#true} is VALID [2018-11-23 12:01:37,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {714#(= main_~i~0 0)} is VALID [2018-11-23 12:01:37,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {714#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {715#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {715#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {716#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {716#(<= main_~i~0 2)} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:37,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#false} ~i~0 := 0; {713#false} is VALID [2018-11-23 12:01:37,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {713#false} is VALID [2018-11-23 12:01:37,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {713#false} is VALID [2018-11-23 12:01:37,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {713#false} is VALID [2018-11-23 12:01:37,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {713#false} is VALID [2018-11-23 12:01:37,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {713#false} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:37,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {713#false} ~i~0 := 0; {713#false} is VALID [2018-11-23 12:01:37,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {713#false} is VALID [2018-11-23 12:01:37,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {713#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {713#false} is VALID [2018-11-23 12:01:37,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {713#false} is VALID [2018-11-23 12:01:37,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {713#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {713#false} is VALID [2018-11-23 12:01:37,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {713#false} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:37,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {713#false} ~i~0 := 0; {713#false} is VALID [2018-11-23 12:01:37,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {713#false} is VALID [2018-11-23 12:01:37,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {713#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#false} is VALID [2018-11-23 12:01:37,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {713#false} is VALID [2018-11-23 12:01:37,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {713#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#false} is VALID [2018-11-23 12:01:37,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {713#false} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:37,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {713#false} havoc ~x~0;~x~0 := 0; {713#false} is VALID [2018-11-23 12:01:37,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {713#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {713#false} is VALID [2018-11-23 12:01:37,942 INFO L256 TraceCheckUtils]: 29: Hoare triple {713#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {713#false} is VALID [2018-11-23 12:01:37,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2018-11-23 12:01:37,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {713#false} assume 0 == ~cond; {713#false} is VALID [2018-11-23 12:01:37,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {713#false} assume !false; {713#false} is VALID [2018-11-23 12:01:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:01:37,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:37,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:37,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:37,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:38,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:38,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2018-11-23 12:01:38,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {712#true} is VALID [2018-11-23 12:01:38,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-23 12:01:38,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #90#return; {712#true} is VALID [2018-11-23 12:01:38,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret9 := main(); {712#true} is VALID [2018-11-23 12:01:38,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {735#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:38,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {735#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {715#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:38,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {715#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {716#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:38,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {716#(<= main_~i~0 2)} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:38,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#false} ~i~0 := 0; {713#false} is VALID [2018-11-23 12:01:38,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {713#false} is VALID [2018-11-23 12:01:38,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {713#false} is VALID [2018-11-23 12:01:38,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {713#false} is VALID [2018-11-23 12:01:38,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {713#false} is VALID [2018-11-23 12:01:38,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {713#false} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:38,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {713#false} ~i~0 := 0; {713#false} is VALID [2018-11-23 12:01:38,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {713#false} is VALID [2018-11-23 12:01:38,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {713#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {713#false} is VALID [2018-11-23 12:01:38,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {713#false} is VALID [2018-11-23 12:01:38,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {713#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {713#false} is VALID [2018-11-23 12:01:38,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {713#false} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:38,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {713#false} ~i~0 := 0; {713#false} is VALID [2018-11-23 12:01:38,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {713#false} is VALID [2018-11-23 12:01:38,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {713#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#false} is VALID [2018-11-23 12:01:38,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {713#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {713#false} is VALID [2018-11-23 12:01:38,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {713#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#false} is VALID [2018-11-23 12:01:38,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {713#false} assume !(~i~0 < 100000); {713#false} is VALID [2018-11-23 12:01:38,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {713#false} havoc ~x~0;~x~0 := 0; {713#false} is VALID [2018-11-23 12:01:38,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {713#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {713#false} is VALID [2018-11-23 12:01:38,196 INFO L256 TraceCheckUtils]: 29: Hoare triple {713#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {713#false} is VALID [2018-11-23 12:01:38,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2018-11-23 12:01:38,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {713#false} assume 0 == ~cond; {713#false} is VALID [2018-11-23 12:01:38,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {713#false} assume !false; {713#false} is VALID [2018-11-23 12:01:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:01:38,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:38,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:01:38,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:01:38,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:38,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:01:38,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:38,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:01:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:01:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:01:38,261 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-23 12:01:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,626 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-23 12:01:38,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:01:38,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:01:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:01:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 12:01:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:01:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 12:01:38,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2018-11-23 12:01:38,734 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 12:01:38,736 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:01:38,736 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:01:38,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:01:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:01:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-23 12:01:38,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:38,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 45 states. [2018-11-23 12:01:38,844 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 45 states. [2018-11-23 12:01:38,845 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 45 states. [2018-11-23 12:01:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,848 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 12:01:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:01:38,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:38,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:38,849 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 48 states. [2018-11-23 12:01:38,849 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 48 states. [2018-11-23 12:01:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,852 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 12:01:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:01:38,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:38,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:38,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:38,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:01:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 12:01:38,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 33 [2018-11-23 12:01:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:38,857 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 12:01:38,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:01:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:01:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:01:38,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:38,859 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:38,859 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:38,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1563249348, now seen corresponding path program 3 times [2018-11-23 12:01:38,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:38,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:39,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 12:01:39,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {1092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1092#true} is VALID [2018-11-23 12:01:39,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 12:01:39,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #90#return; {1092#true} is VALID [2018-11-23 12:01:39,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret9 := main(); {1092#true} is VALID [2018-11-23 12:01:39,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {1092#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1094#(= main_~i~0 0)} is VALID [2018-11-23 12:01:39,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {1094#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1095#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:39,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {1095#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1096#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:39,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {1096#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1097#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:39,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {1097#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {1093#false} ~i~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,027 INFO L273 TraceCheckUtils]: 11: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1093#false} is VALID [2018-11-23 12:01:39,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {1093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#false} is VALID [2018-11-23 12:01:39,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1093#false} is VALID [2018-11-23 12:01:39,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {1093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#false} is VALID [2018-11-23 12:01:39,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1093#false} is VALID [2018-11-23 12:01:39,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {1093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#false} is VALID [2018-11-23 12:01:39,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#false} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#false} ~i~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1093#false} is VALID [2018-11-23 12:01:39,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1093#false} is VALID [2018-11-23 12:01:39,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1093#false} is VALID [2018-11-23 12:01:39,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1093#false} is VALID [2018-11-23 12:01:39,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1093#false} is VALID [2018-11-23 12:01:39,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {1093#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1093#false} is VALID [2018-11-23 12:01:39,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {1093#false} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {1093#false} ~i~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1093#false} is VALID [2018-11-23 12:01:39,032 INFO L273 TraceCheckUtils]: 28: Hoare triple {1093#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#false} is VALID [2018-11-23 12:01:39,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1093#false} is VALID [2018-11-23 12:01:39,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {1093#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#false} is VALID [2018-11-23 12:01:39,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1093#false} is VALID [2018-11-23 12:01:39,033 INFO L273 TraceCheckUtils]: 32: Hoare triple {1093#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#false} is VALID [2018-11-23 12:01:39,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {1093#false} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {1093#false} havoc ~x~0;~x~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {1093#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1093#false} is VALID [2018-11-23 12:01:39,033 INFO L256 TraceCheckUtils]: 36: Hoare triple {1093#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1093#false} is VALID [2018-11-23 12:01:39,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 12:01:39,034 INFO L273 TraceCheckUtils]: 38: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2018-11-23 12:01:39,034 INFO L273 TraceCheckUtils]: 39: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 12:01:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 12:01:39,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:39,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:39,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:01:39,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:39,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:39,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 12:01:39,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {1092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1092#true} is VALID [2018-11-23 12:01:39,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 12:01:39,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #90#return; {1092#true} is VALID [2018-11-23 12:01:39,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret9 := main(); {1092#true} is VALID [2018-11-23 12:01:39,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1092#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1116#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:39,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1095#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:39,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {1095#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1096#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:39,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {1096#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1097#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:39,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {1097#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {1093#false} ~i~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1093#false} is VALID [2018-11-23 12:01:39,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {1093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#false} is VALID [2018-11-23 12:01:39,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1093#false} is VALID [2018-11-23 12:01:39,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {1093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#false} is VALID [2018-11-23 12:01:39,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1093#false} is VALID [2018-11-23 12:01:39,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {1093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1093#false} is VALID [2018-11-23 12:01:39,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#false} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#false} ~i~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1093#false} is VALID [2018-11-23 12:01:39,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1093#false} is VALID [2018-11-23 12:01:39,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1093#false} is VALID [2018-11-23 12:01:39,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1093#false} is VALID [2018-11-23 12:01:39,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1093#false} is VALID [2018-11-23 12:01:39,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {1093#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1093#false} is VALID [2018-11-23 12:01:39,272 INFO L273 TraceCheckUtils]: 25: Hoare triple {1093#false} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {1093#false} ~i~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1093#false} is VALID [2018-11-23 12:01:39,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {1093#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#false} is VALID [2018-11-23 12:01:39,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1093#false} is VALID [2018-11-23 12:01:39,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {1093#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#false} is VALID [2018-11-23 12:01:39,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {1093#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1093#false} is VALID [2018-11-23 12:01:39,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {1093#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#false} is VALID [2018-11-23 12:01:39,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {1093#false} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 12:01:39,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {1093#false} havoc ~x~0;~x~0 := 0; {1093#false} is VALID [2018-11-23 12:01:39,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {1093#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1093#false} is VALID [2018-11-23 12:01:39,275 INFO L256 TraceCheckUtils]: 36: Hoare triple {1093#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1093#false} is VALID [2018-11-23 12:01:39,275 INFO L273 TraceCheckUtils]: 37: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 12:01:39,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2018-11-23 12:01:39,275 INFO L273 TraceCheckUtils]: 39: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 12:01:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 12:01:39,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:39,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:01:39,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-23 12:01:39,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:39,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:01:39,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:39,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:01:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:01:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:39,335 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 7 states. [2018-11-23 12:01:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,645 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-23 12:01:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:01:39,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-23 12:01:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 12:01:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 12:01:39,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2018-11-23 12:01:39,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:39,778 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:01:39,778 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:01:39,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:01:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-11-23 12:01:39,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:39,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 52 states. [2018-11-23 12:01:39,853 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 52 states. [2018-11-23 12:01:39,853 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 52 states. [2018-11-23 12:01:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,855 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-23 12:01:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:01:39,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:39,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:39,856 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 55 states. [2018-11-23 12:01:39,857 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 55 states. [2018-11-23 12:01:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,859 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-23 12:01:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:01:39,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:39,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:39,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:39,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:01:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 12:01:39,863 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 40 [2018-11-23 12:01:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:39,864 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 12:01:39,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:01:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:01:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:01:39,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:39,866 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:39,866 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:39,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1161905130, now seen corresponding path program 4 times [2018-11-23 12:01:39,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:39,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:39,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:39,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:39,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:40,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2018-11-23 12:01:40,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {1539#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1539#true} is VALID [2018-11-23 12:01:40,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-23 12:01:40,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1539#true} {1539#true} #90#return; {1539#true} is VALID [2018-11-23 12:01:40,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {1539#true} call #t~ret9 := main(); {1539#true} is VALID [2018-11-23 12:01:40,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1541#(= main_~i~0 0)} is VALID [2018-11-23 12:01:40,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {1541#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1542#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:40,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {1542#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1543#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:40,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {1543#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1544#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:40,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {1544#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1545#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:40,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {1545#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {1540#false} ~i~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1540#false} is VALID [2018-11-23 12:01:40,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {1540#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1540#false} is VALID [2018-11-23 12:01:40,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1540#false} is VALID [2018-11-23 12:01:40,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {1540#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1540#false} is VALID [2018-11-23 12:01:40,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1540#false} is VALID [2018-11-23 12:01:40,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {1540#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1540#false} is VALID [2018-11-23 12:01:40,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1540#false} is VALID [2018-11-23 12:01:40,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {1540#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1540#false} is VALID [2018-11-23 12:01:40,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {1540#false} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {1540#false} ~i~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,081 INFO L273 TraceCheckUtils]: 29: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {1540#false} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,082 INFO L273 TraceCheckUtils]: 31: Hoare triple {1540#false} ~i~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,082 INFO L273 TraceCheckUtils]: 32: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,082 INFO L273 TraceCheckUtils]: 33: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {1540#false} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {1540#false} havoc ~x~0;~x~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,085 INFO L273 TraceCheckUtils]: 42: Hoare triple {1540#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1540#false} is VALID [2018-11-23 12:01:40,085 INFO L256 TraceCheckUtils]: 43: Hoare triple {1540#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1540#false} is VALID [2018-11-23 12:01:40,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {1540#false} ~cond := #in~cond; {1540#false} is VALID [2018-11-23 12:01:40,086 INFO L273 TraceCheckUtils]: 45: Hoare triple {1540#false} assume 0 == ~cond; {1540#false} is VALID [2018-11-23 12:01:40,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2018-11-23 12:01:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 12:01:40,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:40,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:40,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:40,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:40,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:40,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:40,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2018-11-23 12:01:40,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {1539#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1539#true} is VALID [2018-11-23 12:01:40,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-23 12:01:40,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1539#true} {1539#true} #90#return; {1539#true} is VALID [2018-11-23 12:01:40,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {1539#true} call #t~ret9 := main(); {1539#true} is VALID [2018-11-23 12:01:40,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1539#true} is VALID [2018-11-23 12:01:40,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1539#true} is VALID [2018-11-23 12:01:40,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1539#true} is VALID [2018-11-23 12:01:40,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {1539#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1539#true} is VALID [2018-11-23 12:01:40,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {1539#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1539#true} is VALID [2018-11-23 12:01:40,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {1539#true} assume !(~i~0 < 100000); {1539#true} is VALID [2018-11-23 12:01:40,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {1539#true} ~i~0 := 0; {1582#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:40,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {1582#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1582#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:40,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {1582#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1542#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:40,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {1542#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1542#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:40,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {1542#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1543#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:40,419 INFO L273 TraceCheckUtils]: 16: Hoare triple {1543#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1543#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:40,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {1543#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1544#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:40,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {1544#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1544#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:40,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {1544#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1545#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:40,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {1545#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {1540#false} ~i~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,427 INFO L273 TraceCheckUtils]: 23: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,427 INFO L273 TraceCheckUtils]: 24: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,428 INFO L273 TraceCheckUtils]: 26: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,428 INFO L273 TraceCheckUtils]: 28: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1540#false} is VALID [2018-11-23 12:01:40,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {1540#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1540#false} is VALID [2018-11-23 12:01:40,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {1540#false} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {1540#false} ~i~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,429 INFO L273 TraceCheckUtils]: 32: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,429 INFO L273 TraceCheckUtils]: 34: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,430 INFO L273 TraceCheckUtils]: 37: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,430 INFO L273 TraceCheckUtils]: 38: Hoare triple {1540#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {1540#false} is VALID [2018-11-23 12:01:40,430 INFO L273 TraceCheckUtils]: 39: Hoare triple {1540#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#false} is VALID [2018-11-23 12:01:40,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {1540#false} assume !(~i~0 < 100000); {1540#false} is VALID [2018-11-23 12:01:40,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {1540#false} havoc ~x~0;~x~0 := 0; {1540#false} is VALID [2018-11-23 12:01:40,431 INFO L273 TraceCheckUtils]: 42: Hoare triple {1540#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1540#false} is VALID [2018-11-23 12:01:40,431 INFO L256 TraceCheckUtils]: 43: Hoare triple {1540#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {1540#false} is VALID [2018-11-23 12:01:40,431 INFO L273 TraceCheckUtils]: 44: Hoare triple {1540#false} ~cond := #in~cond; {1540#false} is VALID [2018-11-23 12:01:40,432 INFO L273 TraceCheckUtils]: 45: Hoare triple {1540#false} assume 0 == ~cond; {1540#false} is VALID [2018-11-23 12:01:40,432 INFO L273 TraceCheckUtils]: 46: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2018-11-23 12:01:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 12:01:40,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:01:40,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 12:01:40,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:40,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:01:40,541 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 12:01:40,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:01:40,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:01:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:40,542 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-11-23 12:01:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:41,093 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-23 12:01:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:01:41,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 12:01:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2018-11-23 12:01:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2018-11-23 12:01:41,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2018-11-23 12:01:41,327 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:01:41,329 INFO L225 Difference]: With dead ends: 103 [2018-11-23 12:01:41,329 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:01:41,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:01:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-11-23 12:01:41,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:41,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 59 states. [2018-11-23 12:01:41,413 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 59 states. [2018-11-23 12:01:41,413 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 59 states. [2018-11-23 12:01:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:41,416 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 12:01:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 12:01:41,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:41,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:41,417 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 62 states. [2018-11-23 12:01:41,417 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 62 states. [2018-11-23 12:01:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:41,420 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 12:01:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 12:01:41,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:41,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:41,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:41,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:01:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:01:41,424 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 47 [2018-11-23 12:01:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:41,424 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:01:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:01:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:01:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:01:41,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:41,426 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:41,426 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:41,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash 104059192, now seen corresponding path program 5 times [2018-11-23 12:01:41,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:41,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:41,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:41,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2053#true} is VALID [2018-11-23 12:01:41,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {2053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2053#true} is VALID [2018-11-23 12:01:41,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {2053#true} assume true; {2053#true} is VALID [2018-11-23 12:01:41,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2053#true} {2053#true} #90#return; {2053#true} is VALID [2018-11-23 12:01:41,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {2053#true} call #t~ret9 := main(); {2053#true} is VALID [2018-11-23 12:01:41,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {2053#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2055#(= main_~i~0 0)} is VALID [2018-11-23 12:01:41,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {2055#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:41,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {2056#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2057#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:41,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {2057#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:41,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {2058#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2059#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:41,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {2059#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2060#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:41,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {2060#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2054#false} is VALID [2018-11-23 12:01:41,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {2054#false} ~i~0 := 0; {2054#false} is VALID [2018-11-23 12:01:41,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2054#false} is VALID [2018-11-23 12:01:41,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {2054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2054#false} is VALID [2018-11-23 12:01:41,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2054#false} is VALID [2018-11-23 12:01:41,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {2054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2054#false} is VALID [2018-11-23 12:01:41,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2054#false} is VALID [2018-11-23 12:01:41,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {2054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2054#false} is VALID [2018-11-23 12:01:41,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2054#false} is VALID [2018-11-23 12:01:41,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {2054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2054#false} is VALID [2018-11-23 12:01:41,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2054#false} is VALID [2018-11-23 12:01:41,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {2054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2054#false} is VALID [2018-11-23 12:01:41,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {2054#false} assume !(~i~0 < 100000); {2054#false} is VALID [2018-11-23 12:01:41,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {2054#false} ~i~0 := 0; {2054#false} is VALID [2018-11-23 12:01:41,736 INFO L273 TraceCheckUtils]: 25: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2054#false} is VALID [2018-11-23 12:01:41,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {2054#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2054#false} is VALID [2018-11-23 12:01:41,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2054#false} is VALID [2018-11-23 12:01:41,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {2054#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2054#false} is VALID [2018-11-23 12:01:41,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2054#false} is VALID [2018-11-23 12:01:41,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {2054#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2054#false} is VALID [2018-11-23 12:01:41,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2054#false} is VALID [2018-11-23 12:01:41,737 INFO L273 TraceCheckUtils]: 32: Hoare triple {2054#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2054#false} is VALID [2018-11-23 12:01:41,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2054#false} is VALID [2018-11-23 12:01:41,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {2054#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2054#false} is VALID [2018-11-23 12:01:41,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {2054#false} assume !(~i~0 < 100000); {2054#false} is VALID [2018-11-23 12:01:41,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {2054#false} ~i~0 := 0; {2054#false} is VALID [2018-11-23 12:01:41,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:41,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:41,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:41,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:41,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:41,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:41,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:41,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:41,741 INFO L273 TraceCheckUtils]: 45: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:41,741 INFO L273 TraceCheckUtils]: 46: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:41,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {2054#false} assume !(~i~0 < 100000); {2054#false} is VALID [2018-11-23 12:01:41,741 INFO L273 TraceCheckUtils]: 48: Hoare triple {2054#false} havoc ~x~0;~x~0 := 0; {2054#false} is VALID [2018-11-23 12:01:41,742 INFO L273 TraceCheckUtils]: 49: Hoare triple {2054#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2054#false} is VALID [2018-11-23 12:01:41,742 INFO L256 TraceCheckUtils]: 50: Hoare triple {2054#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {2054#false} is VALID [2018-11-23 12:01:41,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {2054#false} ~cond := #in~cond; {2054#false} is VALID [2018-11-23 12:01:41,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {2054#false} assume 0 == ~cond; {2054#false} is VALID [2018-11-23 12:01:41,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {2054#false} assume !false; {2054#false} is VALID [2018-11-23 12:01:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 12:01:41,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:41,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:41,756 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:43,346 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:01:43,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:43,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:43,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2053#true} is VALID [2018-11-23 12:01:43,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {2053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2053#true} is VALID [2018-11-23 12:01:43,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {2053#true} assume true; {2053#true} is VALID [2018-11-23 12:01:43,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2053#true} {2053#true} #90#return; {2053#true} is VALID [2018-11-23 12:01:43,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {2053#true} call #t~ret9 := main(); {2053#true} is VALID [2018-11-23 12:01:43,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {2053#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2053#true} is VALID [2018-11-23 12:01:43,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {2053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2053#true} is VALID [2018-11-23 12:01:43,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {2053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2053#true} is VALID [2018-11-23 12:01:43,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {2053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2053#true} is VALID [2018-11-23 12:01:43,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {2053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2053#true} is VALID [2018-11-23 12:01:43,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {2053#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2053#true} is VALID [2018-11-23 12:01:43,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {2053#true} assume !(~i~0 < 100000); {2053#true} is VALID [2018-11-23 12:01:43,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {2053#true} ~i~0 := 0; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {2053#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {2053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {2053#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {2053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {2053#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {2053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2053#true} is VALID [2018-11-23 12:01:43,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {2053#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2053#true} is VALID [2018-11-23 12:01:43,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {2053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2053#true} is VALID [2018-11-23 12:01:43,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {2053#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2053#true} is VALID [2018-11-23 12:01:43,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {2053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2053#true} is VALID [2018-11-23 12:01:43,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {2053#true} assume !(~i~0 < 100000); {2053#true} is VALID [2018-11-23 12:01:43,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {2053#true} ~i~0 := 0; {2136#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:43,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {2136#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2136#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:43,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {2136#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2056#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:43,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {2056#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2056#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:43,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {2056#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2057#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:43,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {2057#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2057#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:43,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {2057#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2058#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:43,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {2058#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2058#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:43,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {2058#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2059#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:43,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {2059#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2059#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:43,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {2059#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2060#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:43,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {2060#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2054#false} is VALID [2018-11-23 12:01:43,629 INFO L273 TraceCheckUtils]: 36: Hoare triple {2054#false} ~i~0 := 0; {2054#false} is VALID [2018-11-23 12:01:43,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:43,629 INFO L273 TraceCheckUtils]: 38: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:43,629 INFO L273 TraceCheckUtils]: 39: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:43,630 INFO L273 TraceCheckUtils]: 40: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:43,630 INFO L273 TraceCheckUtils]: 41: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:43,630 INFO L273 TraceCheckUtils]: 42: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:43,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:43,631 INFO L273 TraceCheckUtils]: 44: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:43,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {2054#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2054#false} is VALID [2018-11-23 12:01:43,631 INFO L273 TraceCheckUtils]: 46: Hoare triple {2054#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#false} is VALID [2018-11-23 12:01:43,631 INFO L273 TraceCheckUtils]: 47: Hoare triple {2054#false} assume !(~i~0 < 100000); {2054#false} is VALID [2018-11-23 12:01:43,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {2054#false} havoc ~x~0;~x~0 := 0; {2054#false} is VALID [2018-11-23 12:01:43,632 INFO L273 TraceCheckUtils]: 49: Hoare triple {2054#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2054#false} is VALID [2018-11-23 12:01:43,632 INFO L256 TraceCheckUtils]: 50: Hoare triple {2054#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {2054#false} is VALID [2018-11-23 12:01:43,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {2054#false} ~cond := #in~cond; {2054#false} is VALID [2018-11-23 12:01:43,632 INFO L273 TraceCheckUtils]: 52: Hoare triple {2054#false} assume 0 == ~cond; {2054#false} is VALID [2018-11-23 12:01:43,632 INFO L273 TraceCheckUtils]: 53: Hoare triple {2054#false} assume !false; {2054#false} is VALID [2018-11-23 12:01:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 12:01:43,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:43,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:01:43,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-23 12:01:43,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:43,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:01:43,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:43,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:01:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:01:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:01:43,767 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 9 states. [2018-11-23 12:01:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:44,685 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-11-23 12:01:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:01:44,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-23 12:01:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:01:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-23 12:01:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:01:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-23 12:01:44,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2018-11-23 12:01:44,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:44,804 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:01:44,804 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:01:44,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:01:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:01:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 12:01:44,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:44,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 66 states. [2018-11-23 12:01:44,846 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 66 states. [2018-11-23 12:01:44,846 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 66 states. [2018-11-23 12:01:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:44,848 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:01:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:01:44,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:44,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:44,849 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 69 states. [2018-11-23 12:01:44,849 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 69 states. [2018-11-23 12:01:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:44,851 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:01:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:01:44,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:44,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:44,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:44,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:01:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-23 12:01:44,854 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 54 [2018-11-23 12:01:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:44,854 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-23 12:01:44,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:01:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 12:01:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:01:44,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:44,856 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:44,856 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:44,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:44,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1385759114, now seen corresponding path program 6 times [2018-11-23 12:01:44,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:44,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:45,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {2634#true} call ULTIMATE.init(); {2634#true} is VALID [2018-11-23 12:01:45,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {2634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2634#true} is VALID [2018-11-23 12:01:45,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {2634#true} assume true; {2634#true} is VALID [2018-11-23 12:01:45,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2634#true} {2634#true} #90#return; {2634#true} is VALID [2018-11-23 12:01:45,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {2634#true} call #t~ret9 := main(); {2634#true} is VALID [2018-11-23 12:01:45,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {2634#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2636#(= main_~i~0 0)} is VALID [2018-11-23 12:01:45,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {2636#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2637#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:45,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {2637#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2638#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:45,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2639#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:45,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2640#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:45,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {2640#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2641#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:45,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {2641#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2642#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:45,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {2642#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2635#false} is VALID [2018-11-23 12:01:45,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#false} ~i~0 := 0; {2635#false} is VALID [2018-11-23 12:01:45,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2635#false} is VALID [2018-11-23 12:01:45,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#false} is VALID [2018-11-23 12:01:45,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2635#false} is VALID [2018-11-23 12:01:45,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#false} is VALID [2018-11-23 12:01:45,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2635#false} is VALID [2018-11-23 12:01:45,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {2635#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#false} is VALID [2018-11-23 12:01:45,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2635#false} is VALID [2018-11-23 12:01:45,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#false} is VALID [2018-11-23 12:01:45,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2635#false} is VALID [2018-11-23 12:01:45,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#false} is VALID [2018-11-23 12:01:45,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2635#false} is VALID [2018-11-23 12:01:45,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#false} assume !(~i~0 < 100000); {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#false} ~i~0 := 0; {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2635#false} is VALID [2018-11-23 12:01:45,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2635#false} is VALID [2018-11-23 12:01:45,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2635#false} is VALID [2018-11-23 12:01:45,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2635#false} is VALID [2018-11-23 12:01:45,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2635#false} is VALID [2018-11-23 12:01:45,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2635#false} is VALID [2018-11-23 12:01:45,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2635#false} is VALID [2018-11-23 12:01:45,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2635#false} is VALID [2018-11-23 12:01:45,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2635#false} is VALID [2018-11-23 12:01:45,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#false} assume !(~i~0 < 100000); {2635#false} is VALID [2018-11-23 12:01:45,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#false} ~i~0 := 0; {2635#false} is VALID [2018-11-23 12:01:45,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2635#false} is VALID [2018-11-23 12:01:45,069 INFO L273 TraceCheckUtils]: 43: Hoare triple {2635#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#false} is VALID [2018-11-23 12:01:45,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2635#false} is VALID [2018-11-23 12:01:45,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {2635#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#false} is VALID [2018-11-23 12:01:45,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2635#false} is VALID [2018-11-23 12:01:45,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {2635#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#false} is VALID [2018-11-23 12:01:45,070 INFO L273 TraceCheckUtils]: 48: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2635#false} is VALID [2018-11-23 12:01:45,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {2635#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#false} is VALID [2018-11-23 12:01:45,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2635#false} is VALID [2018-11-23 12:01:45,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#false} is VALID [2018-11-23 12:01:45,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {2635#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2635#false} is VALID [2018-11-23 12:01:45,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2635#false} is VALID [2018-11-23 12:01:45,072 INFO L273 TraceCheckUtils]: 54: Hoare triple {2635#false} assume !(~i~0 < 100000); {2635#false} is VALID [2018-11-23 12:01:45,072 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#false} havoc ~x~0;~x~0 := 0; {2635#false} is VALID [2018-11-23 12:01:45,072 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2635#false} is VALID [2018-11-23 12:01:45,072 INFO L256 TraceCheckUtils]: 57: Hoare triple {2635#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {2635#false} is VALID [2018-11-23 12:01:45,072 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#false} ~cond := #in~cond; {2635#false} is VALID [2018-11-23 12:01:45,073 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#false} assume 0 == ~cond; {2635#false} is VALID [2018-11-23 12:01:45,073 INFO L273 TraceCheckUtils]: 60: Hoare triple {2635#false} assume !false; {2635#false} is VALID [2018-11-23 12:01:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 12:01:45,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:45,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:01:45,657 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:01:45,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:45,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:45,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {2634#true} call ULTIMATE.init(); {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {2634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {2634#true} assume true; {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2634#true} {2634#true} #90#return; {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {2634#true} call #t~ret9 := main(); {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {2634#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {2634#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2634#true} is VALID [2018-11-23 12:01:45,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {2634#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2634#true} is VALID [2018-11-23 12:01:45,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {2634#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2634#true} is VALID [2018-11-23 12:01:45,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {2634#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2634#true} is VALID [2018-11-23 12:01:45,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {2634#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2634#true} is VALID [2018-11-23 12:01:45,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {2634#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2634#true} is VALID [2018-11-23 12:01:45,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {2634#true} assume !(~i~0 < 100000); {2634#true} is VALID [2018-11-23 12:01:45,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {2634#true} ~i~0 := 0; {2634#true} is VALID [2018-11-23 12:01:45,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2634#true} is VALID [2018-11-23 12:01:45,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {2634#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2634#true} is VALID [2018-11-23 12:01:45,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2634#true} is VALID [2018-11-23 12:01:45,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {2634#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2634#true} is VALID [2018-11-23 12:01:45,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2634#true} is VALID [2018-11-23 12:01:45,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {2634#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2634#true} is VALID [2018-11-23 12:01:45,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2634#true} is VALID [2018-11-23 12:01:45,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {2634#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2634#true} is VALID [2018-11-23 12:01:45,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2634#true} is VALID [2018-11-23 12:01:45,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {2634#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2634#true} is VALID [2018-11-23 12:01:45,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2634#true} is VALID [2018-11-23 12:01:45,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {2634#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2634#true} is VALID [2018-11-23 12:01:45,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {2634#true} assume !(~i~0 < 100000); {2634#true} is VALID [2018-11-23 12:01:45,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {2634#true} ~i~0 := 0; {2634#true} is VALID [2018-11-23 12:01:45,849 INFO L273 TraceCheckUtils]: 28: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2634#true} is VALID [2018-11-23 12:01:45,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {2634#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2634#true} is VALID [2018-11-23 12:01:45,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2634#true} is VALID [2018-11-23 12:01:45,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {2634#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2634#true} is VALID [2018-11-23 12:01:45,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2634#true} is VALID [2018-11-23 12:01:45,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {2634#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2634#true} is VALID [2018-11-23 12:01:45,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2634#true} is VALID [2018-11-23 12:01:45,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {2634#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2634#true} is VALID [2018-11-23 12:01:45,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2634#true} is VALID [2018-11-23 12:01:45,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {2634#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2634#true} is VALID [2018-11-23 12:01:45,857 INFO L273 TraceCheckUtils]: 38: Hoare triple {2634#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2760#(< main_~i~0 100000)} is VALID [2018-11-23 12:01:45,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {2760#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2764#(<= main_~i~0 100000)} is VALID [2018-11-23 12:01:45,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {2764#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {2634#true} is VALID [2018-11-23 12:01:45,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {2634#true} ~i~0 := 0; {2771#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:45,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {2771#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2771#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:45,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {2771#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2637#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:45,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {2637#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2637#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:45,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {2637#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2638#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:45,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {2638#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2638#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:45,863 INFO L273 TraceCheckUtils]: 47: Hoare triple {2638#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2639#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:45,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {2639#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2639#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:45,864 INFO L273 TraceCheckUtils]: 49: Hoare triple {2639#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2640#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:45,865 INFO L273 TraceCheckUtils]: 50: Hoare triple {2640#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2640#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:45,869 INFO L273 TraceCheckUtils]: 51: Hoare triple {2640#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2641#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:45,869 INFO L273 TraceCheckUtils]: 52: Hoare triple {2641#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {2641#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:45,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {2641#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2642#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:45,870 INFO L273 TraceCheckUtils]: 54: Hoare triple {2642#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2635#false} is VALID [2018-11-23 12:01:45,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#false} havoc ~x~0;~x~0 := 0; {2635#false} is VALID [2018-11-23 12:01:45,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2635#false} is VALID [2018-11-23 12:01:45,871 INFO L256 TraceCheckUtils]: 57: Hoare triple {2635#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {2635#false} is VALID [2018-11-23 12:01:45,871 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#false} ~cond := #in~cond; {2635#false} is VALID [2018-11-23 12:01:45,871 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#false} assume 0 == ~cond; {2635#false} is VALID [2018-11-23 12:01:45,871 INFO L273 TraceCheckUtils]: 60: Hoare triple {2635#false} assume !false; {2635#false} is VALID [2018-11-23 12:01:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-23 12:01:45,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:45,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 12 [2018-11-23 12:01:45,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 12:01:45,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:45,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:01:45,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:45,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:01:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:01:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:45,954 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 12 states. [2018-11-23 12:01:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:46,537 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2018-11-23 12:01:46,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:01:46,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 12:01:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2018-11-23 12:01:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2018-11-23 12:01:46,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2018-11-23 12:01:46,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:46,742 INFO L225 Difference]: With dead ends: 133 [2018-11-23 12:01:46,745 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:01:46,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:01:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 12:01:46,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:46,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-23 12:01:46,832 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 12:01:46,832 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 12:01:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:46,835 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:01:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:01:46,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:46,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:46,836 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 12:01:46,836 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 12:01:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:46,839 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:01:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:01:46,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:46,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:46,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:46,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:01:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 12:01:46,843 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 61 [2018-11-23 12:01:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:46,843 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 12:01:46,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:01:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:01:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:01:46,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:46,845 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:46,845 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:46,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1749223170, now seen corresponding path program 7 times [2018-11-23 12:01:46,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:46,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:46,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:46,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:46,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:47,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {3311#true} call ULTIMATE.init(); {3311#true} is VALID [2018-11-23 12:01:47,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {3311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3311#true} is VALID [2018-11-23 12:01:47,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {3311#true} assume true; {3311#true} is VALID [2018-11-23 12:01:47,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3311#true} {3311#true} #90#return; {3311#true} is VALID [2018-11-23 12:01:47,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {3311#true} call #t~ret9 := main(); {3311#true} is VALID [2018-11-23 12:01:47,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {3311#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3313#(= main_~i~0 0)} is VALID [2018-11-23 12:01:47,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {3313#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3314#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:47,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {3314#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3315#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:47,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {3315#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3316#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:47,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {3316#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3317#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:47,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {3317#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3318#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:47,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {3318#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3319#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:47,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {3319#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3320#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:47,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {3320#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3321#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:47,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {3321#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {3312#false} ~i~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,191 INFO L273 TraceCheckUtils]: 30: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {3312#false} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {3312#false} ~i~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,192 INFO L273 TraceCheckUtils]: 34: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,194 INFO L273 TraceCheckUtils]: 45: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,194 INFO L273 TraceCheckUtils]: 46: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,194 INFO L273 TraceCheckUtils]: 47: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,195 INFO L273 TraceCheckUtils]: 48: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,195 INFO L273 TraceCheckUtils]: 50: Hoare triple {3312#false} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,195 INFO L273 TraceCheckUtils]: 51: Hoare triple {3312#false} ~i~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,196 INFO L273 TraceCheckUtils]: 53: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,196 INFO L273 TraceCheckUtils]: 54: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,196 INFO L273 TraceCheckUtils]: 55: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,196 INFO L273 TraceCheckUtils]: 56: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,197 INFO L273 TraceCheckUtils]: 60: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,197 INFO L273 TraceCheckUtils]: 61: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,197 INFO L273 TraceCheckUtils]: 62: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,198 INFO L273 TraceCheckUtils]: 64: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,198 INFO L273 TraceCheckUtils]: 65: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,198 INFO L273 TraceCheckUtils]: 66: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,198 INFO L273 TraceCheckUtils]: 67: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,198 INFO L273 TraceCheckUtils]: 68: Hoare triple {3312#false} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,199 INFO L273 TraceCheckUtils]: 69: Hoare triple {3312#false} havoc ~x~0;~x~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,199 INFO L273 TraceCheckUtils]: 70: Hoare triple {3312#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3312#false} is VALID [2018-11-23 12:01:47,199 INFO L256 TraceCheckUtils]: 71: Hoare triple {3312#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {3312#false} is VALID [2018-11-23 12:01:47,199 INFO L273 TraceCheckUtils]: 72: Hoare triple {3312#false} ~cond := #in~cond; {3312#false} is VALID [2018-11-23 12:01:47,199 INFO L273 TraceCheckUtils]: 73: Hoare triple {3312#false} assume 0 == ~cond; {3312#false} is VALID [2018-11-23 12:01:47,200 INFO L273 TraceCheckUtils]: 74: Hoare triple {3312#false} assume !false; {3312#false} is VALID [2018-11-23 12:01:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:01:47,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:47,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:47,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:47,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:47,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {3311#true} call ULTIMATE.init(); {3311#true} is VALID [2018-11-23 12:01:47,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {3311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3311#true} is VALID [2018-11-23 12:01:47,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {3311#true} assume true; {3311#true} is VALID [2018-11-23 12:01:47,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3311#true} {3311#true} #90#return; {3311#true} is VALID [2018-11-23 12:01:47,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {3311#true} call #t~ret9 := main(); {3311#true} is VALID [2018-11-23 12:01:47,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {3311#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3340#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:47,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {3340#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3314#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:47,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {3314#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3315#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:47,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {3315#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3316#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:47,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {3316#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3317#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:47,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {3317#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3318#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:47,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {3318#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3319#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:47,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {3319#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3320#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:47,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {3320#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3321#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:47,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {3321#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {3312#false} ~i~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3312#false} is VALID [2018-11-23 12:01:47,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {3312#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3312#false} is VALID [2018-11-23 12:01:47,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {3312#false} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {3312#false} ~i~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,520 INFO L273 TraceCheckUtils]: 35: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,520 INFO L273 TraceCheckUtils]: 38: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,521 INFO L273 TraceCheckUtils]: 40: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,521 INFO L273 TraceCheckUtils]: 42: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3312#false} is VALID [2018-11-23 12:01:47,522 INFO L273 TraceCheckUtils]: 49: Hoare triple {3312#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3312#false} is VALID [2018-11-23 12:01:47,523 INFO L273 TraceCheckUtils]: 50: Hoare triple {3312#false} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,523 INFO L273 TraceCheckUtils]: 51: Hoare triple {3312#false} ~i~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,524 INFO L273 TraceCheckUtils]: 57: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,524 INFO L273 TraceCheckUtils]: 58: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,524 INFO L273 TraceCheckUtils]: 59: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,525 INFO L273 TraceCheckUtils]: 61: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,525 INFO L273 TraceCheckUtils]: 64: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,525 INFO L273 TraceCheckUtils]: 66: Hoare triple {3312#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {3312#false} is VALID [2018-11-23 12:01:47,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {3312#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3312#false} is VALID [2018-11-23 12:01:47,526 INFO L273 TraceCheckUtils]: 68: Hoare triple {3312#false} assume !(~i~0 < 100000); {3312#false} is VALID [2018-11-23 12:01:47,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {3312#false} havoc ~x~0;~x~0 := 0; {3312#false} is VALID [2018-11-23 12:01:47,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {3312#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3312#false} is VALID [2018-11-23 12:01:47,526 INFO L256 TraceCheckUtils]: 71: Hoare triple {3312#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {3312#false} is VALID [2018-11-23 12:01:47,527 INFO L273 TraceCheckUtils]: 72: Hoare triple {3312#false} ~cond := #in~cond; {3312#false} is VALID [2018-11-23 12:01:47,527 INFO L273 TraceCheckUtils]: 73: Hoare triple {3312#false} assume 0 == ~cond; {3312#false} is VALID [2018-11-23 12:01:47,527 INFO L273 TraceCheckUtils]: 74: Hoare triple {3312#false} assume !false; {3312#false} is VALID [2018-11-23 12:01:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:01:47,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:47,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:01:47,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-11-23 12:01:47,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:47,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:01:47,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:47,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:01:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:01:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:47,594 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 12 states. [2018-11-23 12:01:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:48,057 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-11-23 12:01:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:01:48,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-11-23 12:01:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2018-11-23 12:01:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2018-11-23 12:01:48,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 121 transitions. [2018-11-23 12:01:48,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:48,227 INFO L225 Difference]: With dead ends: 155 [2018-11-23 12:01:48,227 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:01:48,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:01:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-11-23 12:01:48,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:48,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 87 states. [2018-11-23 12:01:48,293 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 87 states. [2018-11-23 12:01:48,294 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 87 states. [2018-11-23 12:01:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:48,296 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:01:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:01:48,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:48,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:48,297 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 90 states. [2018-11-23 12:01:48,297 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 90 states. [2018-11-23 12:01:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:48,300 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:01:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:01:48,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:48,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:48,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:48,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:01:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:01:48,304 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 75 [2018-11-23 12:01:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:48,305 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:01:48,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:01:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:01:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:01:48,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:48,306 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:48,306 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:48,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1643836448, now seen corresponding path program 8 times [2018-11-23 12:01:48,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:48,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:48,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {4093#true} call ULTIMATE.init(); {4093#true} is VALID [2018-11-23 12:01:48,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {4093#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4093#true} is VALID [2018-11-23 12:01:48,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {4093#true} assume true; {4093#true} is VALID [2018-11-23 12:01:48,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4093#true} {4093#true} #90#return; {4093#true} is VALID [2018-11-23 12:01:48,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {4093#true} call #t~ret9 := main(); {4093#true} is VALID [2018-11-23 12:01:48,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {4093#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4095#(= main_~i~0 0)} is VALID [2018-11-23 12:01:48,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {4095#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4096#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:48,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {4096#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4097#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:48,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {4097#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4098#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:48,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {4098#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4099#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:48,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {4099#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4100#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:48,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {4100#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4101#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:48,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {4101#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4102#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:48,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {4102#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4103#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:48,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {4103#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4104#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:48,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {4104#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:48,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {4094#false} ~i~0 := 0; {4094#false} is VALID [2018-11-23 12:01:48,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:48,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:48,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {4094#false} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:48,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {4094#false} ~i~0 := 0; {4094#false} is VALID [2018-11-23 12:01:48,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,668 INFO L273 TraceCheckUtils]: 38: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,670 INFO L273 TraceCheckUtils]: 46: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,670 INFO L273 TraceCheckUtils]: 47: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:48,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:48,671 INFO L273 TraceCheckUtils]: 55: Hoare triple {4094#false} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:48,671 INFO L273 TraceCheckUtils]: 56: Hoare triple {4094#false} ~i~0 := 0; {4094#false} is VALID [2018-11-23 12:01:48,672 INFO L273 TraceCheckUtils]: 57: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,672 INFO L273 TraceCheckUtils]: 58: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,672 INFO L273 TraceCheckUtils]: 59: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,673 INFO L273 TraceCheckUtils]: 63: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,673 INFO L273 TraceCheckUtils]: 64: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,673 INFO L273 TraceCheckUtils]: 65: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,673 INFO L273 TraceCheckUtils]: 66: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,674 INFO L273 TraceCheckUtils]: 69: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,674 INFO L273 TraceCheckUtils]: 70: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,674 INFO L273 TraceCheckUtils]: 71: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,674 INFO L273 TraceCheckUtils]: 72: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,674 INFO L273 TraceCheckUtils]: 73: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:48,675 INFO L273 TraceCheckUtils]: 74: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:48,675 INFO L273 TraceCheckUtils]: 75: Hoare triple {4094#false} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:48,675 INFO L273 TraceCheckUtils]: 76: Hoare triple {4094#false} havoc ~x~0;~x~0 := 0; {4094#false} is VALID [2018-11-23 12:01:48,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {4094#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4094#false} is VALID [2018-11-23 12:01:48,675 INFO L256 TraceCheckUtils]: 78: Hoare triple {4094#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {4094#false} is VALID [2018-11-23 12:01:48,675 INFO L273 TraceCheckUtils]: 79: Hoare triple {4094#false} ~cond := #in~cond; {4094#false} is VALID [2018-11-23 12:01:48,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {4094#false} assume 0 == ~cond; {4094#false} is VALID [2018-11-23 12:01:48,676 INFO L273 TraceCheckUtils]: 81: Hoare triple {4094#false} assume !false; {4094#false} is VALID [2018-11-23 12:01:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-23 12:01:48,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:48,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:48,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:48,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:48,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:49,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {4093#true} call ULTIMATE.init(); {4093#true} is VALID [2018-11-23 12:01:49,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {4093#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4093#true} is VALID [2018-11-23 12:01:49,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {4093#true} assume true; {4093#true} is VALID [2018-11-23 12:01:49,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4093#true} {4093#true} #90#return; {4093#true} is VALID [2018-11-23 12:01:49,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {4093#true} call #t~ret9 := main(); {4093#true} is VALID [2018-11-23 12:01:49,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {4093#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4123#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:49,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {4123#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4096#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:49,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {4096#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4097#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:49,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {4097#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4098#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:49,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {4098#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4099#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:49,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {4099#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4100#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:49,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {4100#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4101#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:49,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {4101#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4102#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:49,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {4102#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4103#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:49,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {4103#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4104#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:49,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {4104#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:49,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {4094#false} ~i~0 := 0; {4094#false} is VALID [2018-11-23 12:01:49,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,081 INFO L273 TraceCheckUtils]: 20: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,081 INFO L273 TraceCheckUtils]: 21: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,084 INFO L273 TraceCheckUtils]: 33: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4094#false} is VALID [2018-11-23 12:01:49,084 INFO L273 TraceCheckUtils]: 34: Hoare triple {4094#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4094#false} is VALID [2018-11-23 12:01:49,084 INFO L273 TraceCheckUtils]: 35: Hoare triple {4094#false} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:49,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {4094#false} ~i~0 := 0; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 37: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 39: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 42: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 45: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {4094#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 55: Hoare triple {4094#false} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 56: Hoare triple {4094#false} ~i~0 := 0; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 57: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,087 INFO L273 TraceCheckUtils]: 59: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 61: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 62: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 63: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 64: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 65: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 66: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,088 INFO L273 TraceCheckUtils]: 67: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,089 INFO L273 TraceCheckUtils]: 68: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,089 INFO L273 TraceCheckUtils]: 69: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,089 INFO L273 TraceCheckUtils]: 70: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,089 INFO L273 TraceCheckUtils]: 71: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,089 INFO L273 TraceCheckUtils]: 72: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {4094#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4094#false} is VALID [2018-11-23 12:01:49,090 INFO L273 TraceCheckUtils]: 74: Hoare triple {4094#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4094#false} is VALID [2018-11-23 12:01:49,090 INFO L273 TraceCheckUtils]: 75: Hoare triple {4094#false} assume !(~i~0 < 100000); {4094#false} is VALID [2018-11-23 12:01:49,090 INFO L273 TraceCheckUtils]: 76: Hoare triple {4094#false} havoc ~x~0;~x~0 := 0; {4094#false} is VALID [2018-11-23 12:01:49,090 INFO L273 TraceCheckUtils]: 77: Hoare triple {4094#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4094#false} is VALID [2018-11-23 12:01:49,090 INFO L256 TraceCheckUtils]: 78: Hoare triple {4094#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {4094#false} is VALID [2018-11-23 12:01:49,091 INFO L273 TraceCheckUtils]: 79: Hoare triple {4094#false} ~cond := #in~cond; {4094#false} is VALID [2018-11-23 12:01:49,091 INFO L273 TraceCheckUtils]: 80: Hoare triple {4094#false} assume 0 == ~cond; {4094#false} is VALID [2018-11-23 12:01:49,091 INFO L273 TraceCheckUtils]: 81: Hoare triple {4094#false} assume !false; {4094#false} is VALID [2018-11-23 12:01:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-23 12:01:49,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:49,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:01:49,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-11-23 12:01:49,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:49,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:01:49,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:01:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:01:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:01:49,179 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2018-11-23 12:01:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:49,780 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-23 12:01:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:01:49,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-11-23 12:01:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:01:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 12:01:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:01:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 12:01:49,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 128 transitions. [2018-11-23 12:01:49,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:49,977 INFO L225 Difference]: With dead ends: 168 [2018-11-23 12:01:49,977 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:01:49,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:01:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:01:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-23 12:01:50,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:50,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 94 states. [2018-11-23 12:01:50,143 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 94 states. [2018-11-23 12:01:50,143 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 94 states. [2018-11-23 12:01:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:50,147 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-23 12:01:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:01:50,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:50,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:50,148 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 97 states. [2018-11-23 12:01:50,148 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 97 states. [2018-11-23 12:01:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:50,151 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-23 12:01:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-11-23 12:01:50,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:50,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:50,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:50,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:01:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-11-23 12:01:50,155 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 82 [2018-11-23 12:01:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:50,155 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-11-23 12:01:50,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:01:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-11-23 12:01:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 12:01:50,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:50,156 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:50,157 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:50,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1732223602, now seen corresponding path program 9 times [2018-11-23 12:01:50,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:50,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:50,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:50,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:50,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:50,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2018-11-23 12:01:50,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {4942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4942#true} is VALID [2018-11-23 12:01:50,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2018-11-23 12:01:50,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #90#return; {4942#true} is VALID [2018-11-23 12:01:50,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret9 := main(); {4942#true} is VALID [2018-11-23 12:01:50,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4944#(= main_~i~0 0)} is VALID [2018-11-23 12:01:50,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {4944#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4945#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:50,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {4945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:50,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {4946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4947#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:50,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {4947#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4948#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:50,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {4948#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4949#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:50,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {4949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4950#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:50,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {4950#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4951#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:50,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {4951#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4952#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:50,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {4952#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4953#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:50,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {4953#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4954#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:50,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {4954#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:50,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2018-11-23 12:01:50,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:50,978 INFO L273 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:50,978 INFO L273 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:50,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2018-11-23 12:01:50,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,979 INFO L273 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 50: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 51: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,980 INFO L273 TraceCheckUtils]: 53: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,981 INFO L273 TraceCheckUtils]: 54: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,981 INFO L273 TraceCheckUtils]: 55: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,981 INFO L273 TraceCheckUtils]: 56: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,981 INFO L273 TraceCheckUtils]: 57: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,981 INFO L273 TraceCheckUtils]: 58: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:50,981 INFO L273 TraceCheckUtils]: 59: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:50,982 INFO L273 TraceCheckUtils]: 60: Hoare triple {4943#false} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:50,982 INFO L273 TraceCheckUtils]: 61: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2018-11-23 12:01:50,982 INFO L273 TraceCheckUtils]: 62: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,982 INFO L273 TraceCheckUtils]: 64: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,982 INFO L273 TraceCheckUtils]: 65: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 66: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 67: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 68: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 69: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 70: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 71: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,983 INFO L273 TraceCheckUtils]: 72: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,984 INFO L273 TraceCheckUtils]: 73: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,984 INFO L273 TraceCheckUtils]: 74: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,984 INFO L273 TraceCheckUtils]: 75: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,984 INFO L273 TraceCheckUtils]: 76: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,984 INFO L273 TraceCheckUtils]: 77: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,984 INFO L273 TraceCheckUtils]: 78: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,985 INFO L273 TraceCheckUtils]: 79: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,985 INFO L273 TraceCheckUtils]: 80: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:50,985 INFO L273 TraceCheckUtils]: 81: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:50,985 INFO L273 TraceCheckUtils]: 82: Hoare triple {4943#false} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:50,985 INFO L273 TraceCheckUtils]: 83: Hoare triple {4943#false} havoc ~x~0;~x~0 := 0; {4943#false} is VALID [2018-11-23 12:01:50,986 INFO L273 TraceCheckUtils]: 84: Hoare triple {4943#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4943#false} is VALID [2018-11-23 12:01:50,986 INFO L256 TraceCheckUtils]: 85: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {4943#false} is VALID [2018-11-23 12:01:50,986 INFO L273 TraceCheckUtils]: 86: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2018-11-23 12:01:50,986 INFO L273 TraceCheckUtils]: 87: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2018-11-23 12:01:50,986 INFO L273 TraceCheckUtils]: 88: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2018-11-23 12:01:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:01:50,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:50,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:51,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:51,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:01:51,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:51,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:52,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2018-11-23 12:01:52,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {4942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4942#true} is VALID [2018-11-23 12:01:52,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2018-11-23 12:01:52,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #90#return; {4942#true} is VALID [2018-11-23 12:01:52,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret9 := main(); {4942#true} is VALID [2018-11-23 12:01:52,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4973#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:52,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4945#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:52,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {4945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:52,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {4946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4947#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:52,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {4947#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4948#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:52,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {4948#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4949#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:52,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {4949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4950#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:52,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {4950#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4951#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:52,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {4951#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4952#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:52,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {4952#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4953#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:52,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {4953#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4954#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:52,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {4954#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:52,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 54: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 55: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,033 INFO L273 TraceCheckUtils]: 56: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 58: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {4943#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 60: Hoare triple {4943#false} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 61: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 62: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,034 INFO L273 TraceCheckUtils]: 63: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 64: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 65: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 66: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 67: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 68: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 71: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,035 INFO L273 TraceCheckUtils]: 72: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 73: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 74: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 75: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 76: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 77: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 79: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {4943#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 81: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 82: Hoare triple {4943#false} assume !(~i~0 < 100000); {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 83: Hoare triple {4943#false} havoc ~x~0;~x~0 := 0; {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 84: Hoare triple {4943#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L256 TraceCheckUtils]: 85: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 86: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 87: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2018-11-23 12:01:52,037 INFO L273 TraceCheckUtils]: 88: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2018-11-23 12:01:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:01:52,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:52,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:01:52,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-11-23 12:01:52,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:52,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:01:52,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:52,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:01:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:01:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:52,103 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 14 states. [2018-11-23 12:01:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:52,961 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-11-23 12:01:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:01:52,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-11-23 12:01:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2018-11-23 12:01:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2018-11-23 12:01:52,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2018-11-23 12:01:53,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:53,103 INFO L225 Difference]: With dead ends: 181 [2018-11-23 12:01:53,103 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:01:53,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:01:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-23 12:01:53,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:53,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 101 states. [2018-11-23 12:01:53,165 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 101 states. [2018-11-23 12:01:53,165 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 101 states. [2018-11-23 12:01:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:53,167 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 12:01:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 12:01:53,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:53,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:53,168 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 104 states. [2018-11-23 12:01:53,168 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 104 states. [2018-11-23 12:01:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:53,170 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 12:01:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 12:01:53,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:53,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:53,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:53,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:01:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-23 12:01:53,174 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 89 [2018-11-23 12:01:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:53,174 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-23 12:01:53,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:01:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:01:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:01:53,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:53,175 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:53,176 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:53,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2111467372, now seen corresponding path program 10 times [2018-11-23 12:01:53,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:53,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:53,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:53,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5858#true} is VALID [2018-11-23 12:01:53,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {5858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5858#true} is VALID [2018-11-23 12:01:53,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2018-11-23 12:01:53,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #90#return; {5858#true} is VALID [2018-11-23 12:01:53,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret9 := main(); {5858#true} is VALID [2018-11-23 12:01:53,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {5858#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5860#(= main_~i~0 0)} is VALID [2018-11-23 12:01:53,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {5860#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5861#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:53,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {5861#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5862#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:53,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {5862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5863#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:53,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {5863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5864#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:53,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {5864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5865#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:53,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {5865#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5866#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:53,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {5866#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5867#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:53,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {5867#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5868#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:53,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {5868#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5869#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:53,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {5869#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5870#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:53,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {5870#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5871#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:53,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {5871#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5859#false} is VALID [2018-11-23 12:01:53,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {5859#false} ~i~0 := 0; {5859#false} is VALID [2018-11-23 12:01:53,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {5859#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {5859#false} assume !(~i~0 < 100000); {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {5859#false} ~i~0 := 0; {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 44: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,835 INFO L273 TraceCheckUtils]: 45: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 50: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 51: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 52: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,836 INFO L273 TraceCheckUtils]: 53: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 54: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 58: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 59: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 60: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,837 INFO L273 TraceCheckUtils]: 61: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 64: Hoare triple {5859#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 65: Hoare triple {5859#false} assume !(~i~0 < 100000); {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 66: Hoare triple {5859#false} ~i~0 := 0; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 67: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 68: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,838 INFO L273 TraceCheckUtils]: 69: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 70: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 71: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 72: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 73: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 74: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 75: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,839 INFO L273 TraceCheckUtils]: 76: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,840 INFO L273 TraceCheckUtils]: 78: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,840 INFO L273 TraceCheckUtils]: 79: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,840 INFO L273 TraceCheckUtils]: 80: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,840 INFO L273 TraceCheckUtils]: 81: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,841 INFO L273 TraceCheckUtils]: 85: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,841 INFO L273 TraceCheckUtils]: 86: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,842 INFO L273 TraceCheckUtils]: 87: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:53,842 INFO L273 TraceCheckUtils]: 88: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:53,842 INFO L273 TraceCheckUtils]: 89: Hoare triple {5859#false} assume !(~i~0 < 100000); {5859#false} is VALID [2018-11-23 12:01:53,842 INFO L273 TraceCheckUtils]: 90: Hoare triple {5859#false} havoc ~x~0;~x~0 := 0; {5859#false} is VALID [2018-11-23 12:01:53,842 INFO L273 TraceCheckUtils]: 91: Hoare triple {5859#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5859#false} is VALID [2018-11-23 12:01:53,842 INFO L256 TraceCheckUtils]: 92: Hoare triple {5859#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {5859#false} is VALID [2018-11-23 12:01:53,843 INFO L273 TraceCheckUtils]: 93: Hoare triple {5859#false} ~cond := #in~cond; {5859#false} is VALID [2018-11-23 12:01:53,843 INFO L273 TraceCheckUtils]: 94: Hoare triple {5859#false} assume 0 == ~cond; {5859#false} is VALID [2018-11-23 12:01:53,843 INFO L273 TraceCheckUtils]: 95: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2018-11-23 12:01:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-11-23 12:01:53,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:53,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:53,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:53,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:53,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:54,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5858#true} is VALID [2018-11-23 12:01:54,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {5858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5858#true} is VALID [2018-11-23 12:01:54,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2018-11-23 12:01:54,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #90#return; {5858#true} is VALID [2018-11-23 12:01:54,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret9 := main(); {5858#true} is VALID [2018-11-23 12:01:54,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {5858#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5858#true} is VALID [2018-11-23 12:01:54,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {5858#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5858#true} is VALID [2018-11-23 12:01:54,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {5858#true} assume !(~i~0 < 100000); {5858#true} is VALID [2018-11-23 12:01:54,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {5858#true} ~i~0 := 0; {5858#true} is VALID [2018-11-23 12:01:54,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {5858#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5858#true} is VALID [2018-11-23 12:01:54,186 INFO L273 TraceCheckUtils]: 40: Hoare triple {5858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#true} is VALID [2018-11-23 12:01:54,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {5858#true} assume !(~i~0 < 100000); {5858#true} is VALID [2018-11-23 12:01:54,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {5858#true} ~i~0 := 0; {6001#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:54,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {6001#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6001#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:54,187 INFO L273 TraceCheckUtils]: 44: Hoare triple {6001#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5861#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:54,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {5861#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5861#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:54,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {5861#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5862#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:54,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {5862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5862#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:54,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {5862#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5863#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:54,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {5863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5863#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:54,190 INFO L273 TraceCheckUtils]: 50: Hoare triple {5863#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5864#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:54,191 INFO L273 TraceCheckUtils]: 51: Hoare triple {5864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5864#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:54,192 INFO L273 TraceCheckUtils]: 52: Hoare triple {5864#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5865#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:54,192 INFO L273 TraceCheckUtils]: 53: Hoare triple {5865#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5865#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:54,193 INFO L273 TraceCheckUtils]: 54: Hoare triple {5865#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5866#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:54,193 INFO L273 TraceCheckUtils]: 55: Hoare triple {5866#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5866#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:54,194 INFO L273 TraceCheckUtils]: 56: Hoare triple {5866#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5867#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:54,195 INFO L273 TraceCheckUtils]: 57: Hoare triple {5867#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5867#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:54,196 INFO L273 TraceCheckUtils]: 58: Hoare triple {5867#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5868#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:54,196 INFO L273 TraceCheckUtils]: 59: Hoare triple {5868#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5868#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:54,197 INFO L273 TraceCheckUtils]: 60: Hoare triple {5868#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5869#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:54,197 INFO L273 TraceCheckUtils]: 61: Hoare triple {5869#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5869#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:54,198 INFO L273 TraceCheckUtils]: 62: Hoare triple {5869#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5870#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:54,199 INFO L273 TraceCheckUtils]: 63: Hoare triple {5870#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5870#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:54,199 INFO L273 TraceCheckUtils]: 64: Hoare triple {5870#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5871#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:54,200 INFO L273 TraceCheckUtils]: 65: Hoare triple {5871#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5859#false} is VALID [2018-11-23 12:01:54,200 INFO L273 TraceCheckUtils]: 66: Hoare triple {5859#false} ~i~0 := 0; {5859#false} is VALID [2018-11-23 12:01:54,201 INFO L273 TraceCheckUtils]: 67: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,201 INFO L273 TraceCheckUtils]: 68: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,201 INFO L273 TraceCheckUtils]: 69: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,201 INFO L273 TraceCheckUtils]: 71: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,202 INFO L273 TraceCheckUtils]: 74: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,202 INFO L273 TraceCheckUtils]: 75: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 76: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 77: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 78: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 79: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 80: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 81: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 82: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,203 INFO L273 TraceCheckUtils]: 83: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 84: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 85: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 86: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 87: Hoare triple {5859#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {5859#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 89: Hoare triple {5859#false} assume !(~i~0 < 100000); {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 90: Hoare triple {5859#false} havoc ~x~0;~x~0 := 0; {5859#false} is VALID [2018-11-23 12:01:54,204 INFO L273 TraceCheckUtils]: 91: Hoare triple {5859#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5859#false} is VALID [2018-11-23 12:01:54,205 INFO L256 TraceCheckUtils]: 92: Hoare triple {5859#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {5859#false} is VALID [2018-11-23 12:01:54,205 INFO L273 TraceCheckUtils]: 93: Hoare triple {5859#false} ~cond := #in~cond; {5859#false} is VALID [2018-11-23 12:01:54,205 INFO L273 TraceCheckUtils]: 94: Hoare triple {5859#false} assume 0 == ~cond; {5859#false} is VALID [2018-11-23 12:01:54,205 INFO L273 TraceCheckUtils]: 95: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2018-11-23 12:01:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-23 12:01:54,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:54,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:01:54,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2018-11-23 12:01:54,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:54,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:01:54,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:54,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:01:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:01:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:01:54,296 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 15 states. [2018-11-23 12:01:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:54,858 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2018-11-23 12:01:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:01:54,859 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2018-11-23 12:01:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:01:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 142 transitions. [2018-11-23 12:01:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:01:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 142 transitions. [2018-11-23 12:01:54,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 142 transitions. [2018-11-23 12:01:55,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:55,462 INFO L225 Difference]: With dead ends: 194 [2018-11-23 12:01:55,462 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:01:55,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:01:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:01:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-11-23 12:01:55,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:55,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 108 states. [2018-11-23 12:01:55,520 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 108 states. [2018-11-23 12:01:55,520 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 108 states. [2018-11-23 12:01:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:55,523 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-23 12:01:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:01:55,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:55,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:55,524 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 111 states. [2018-11-23 12:01:55,524 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 111 states. [2018-11-23 12:01:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:55,526 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-23 12:01:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:01:55,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:55,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:55,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:55,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:01:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-11-23 12:01:55,530 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 96 [2018-11-23 12:01:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:55,530 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-11-23 12:01:55,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:01:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:01:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:01:55,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:55,532 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:55,532 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:55,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash -88736282, now seen corresponding path program 11 times [2018-11-23 12:01:55,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:55,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:56,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {6841#true} call ULTIMATE.init(); {6841#true} is VALID [2018-11-23 12:01:56,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {6841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6841#true} is VALID [2018-11-23 12:01:56,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {6841#true} assume true; {6841#true} is VALID [2018-11-23 12:01:56,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6841#true} {6841#true} #90#return; {6841#true} is VALID [2018-11-23 12:01:56,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {6841#true} call #t~ret9 := main(); {6841#true} is VALID [2018-11-23 12:01:56,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {6841#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6843#(= main_~i~0 0)} is VALID [2018-11-23 12:01:56,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {6843#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6844#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:56,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {6844#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6845#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:56,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {6845#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6846#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:56,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {6846#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6847#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:56,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {6847#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6848#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:56,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {6848#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6849#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:56,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {6849#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6850#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:56,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {6850#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6851#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:56,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {6851#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6852#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:56,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {6852#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6853#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:56,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {6853#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6854#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:56,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {6854#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:56,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {6855#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6842#false} is VALID [2018-11-23 12:01:56,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {6842#false} ~i~0 := 0; {6842#false} is VALID [2018-11-23 12:01:56,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {6842#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 44: Hoare triple {6842#false} assume !(~i~0 < 100000); {6842#false} is VALID [2018-11-23 12:01:56,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {6842#false} ~i~0 := 0; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 48: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 49: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 50: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 51: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 52: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 55: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 56: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 57: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 58: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 59: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 60: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,189 INFO L273 TraceCheckUtils]: 62: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 65: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 66: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 67: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 68: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 69: Hoare triple {6842#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6842#false} is VALID [2018-11-23 12:01:56,190 INFO L273 TraceCheckUtils]: 70: Hoare triple {6842#false} assume !(~i~0 < 100000); {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 71: Hoare triple {6842#false} ~i~0 := 0; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 72: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 73: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 74: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 75: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 76: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 77: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,191 INFO L273 TraceCheckUtils]: 78: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 79: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 80: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 81: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 82: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 83: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 84: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 85: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 86: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,192 INFO L273 TraceCheckUtils]: 87: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 88: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 89: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 90: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 91: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 92: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 93: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 94: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:01:56,193 INFO L273 TraceCheckUtils]: 95: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:01:56,194 INFO L273 TraceCheckUtils]: 96: Hoare triple {6842#false} assume !(~i~0 < 100000); {6842#false} is VALID [2018-11-23 12:01:56,194 INFO L273 TraceCheckUtils]: 97: Hoare triple {6842#false} havoc ~x~0;~x~0 := 0; {6842#false} is VALID [2018-11-23 12:01:56,194 INFO L273 TraceCheckUtils]: 98: Hoare triple {6842#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6842#false} is VALID [2018-11-23 12:01:56,194 INFO L256 TraceCheckUtils]: 99: Hoare triple {6842#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {6842#false} is VALID [2018-11-23 12:01:56,194 INFO L273 TraceCheckUtils]: 100: Hoare triple {6842#false} ~cond := #in~cond; {6842#false} is VALID [2018-11-23 12:01:56,194 INFO L273 TraceCheckUtils]: 101: Hoare triple {6842#false} assume 0 == ~cond; {6842#false} is VALID [2018-11-23 12:01:56,195 INFO L273 TraceCheckUtils]: 102: Hoare triple {6842#false} assume !false; {6842#false} is VALID [2018-11-23 12:01:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-11-23 12:01:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:56,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:56,216 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:50,157 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 12:02:50,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:50,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {6841#true} call ULTIMATE.init(); {6841#true} is VALID [2018-11-23 12:02:50,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {6841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6841#true} is VALID [2018-11-23 12:02:50,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {6841#true} assume true; {6841#true} is VALID [2018-11-23 12:02:50,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6841#true} {6841#true} #90#return; {6841#true} is VALID [2018-11-23 12:02:50,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {6841#true} call #t~ret9 := main(); {6841#true} is VALID [2018-11-23 12:02:50,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {6841#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6841#true} is VALID [2018-11-23 12:02:50,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {6841#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {6841#true} assume !(~i~0 < 100000); {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {6841#true} ~i~0 := 0; {6841#true} is VALID [2018-11-23 12:02:50,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {6841#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {6841#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6841#true} is VALID [2018-11-23 12:02:50,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {6841#true} assume !(~i~0 < 100000); {6841#true} is VALID [2018-11-23 12:02:50,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {6841#true} ~i~0 := 0; {6994#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:50,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {6994#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6994#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:50,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {6994#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6844#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {6844#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6844#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {6844#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6845#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {6845#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6845#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {6845#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6846#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,414 INFO L273 TraceCheckUtils]: 52: Hoare triple {6846#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6846#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,414 INFO L273 TraceCheckUtils]: 53: Hoare triple {6846#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6847#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,415 INFO L273 TraceCheckUtils]: 54: Hoare triple {6847#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6847#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,415 INFO L273 TraceCheckUtils]: 55: Hoare triple {6847#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6848#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,416 INFO L273 TraceCheckUtils]: 56: Hoare triple {6848#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6848#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {6848#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6849#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {6849#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6849#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {6849#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6850#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {6850#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6850#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,419 INFO L273 TraceCheckUtils]: 61: Hoare triple {6850#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6851#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {6851#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6851#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {6851#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6852#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,421 INFO L273 TraceCheckUtils]: 64: Hoare triple {6852#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6852#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {6852#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6853#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,422 INFO L273 TraceCheckUtils]: 66: Hoare triple {6853#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6853#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,423 INFO L273 TraceCheckUtils]: 67: Hoare triple {6853#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6854#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:50,424 INFO L273 TraceCheckUtils]: 68: Hoare triple {6854#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6854#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:50,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {6854#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6855#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:50,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {6855#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6842#false} is VALID [2018-11-23 12:02:50,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {6842#false} ~i~0 := 0; {6842#false} is VALID [2018-11-23 12:02:50,426 INFO L273 TraceCheckUtils]: 72: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,426 INFO L273 TraceCheckUtils]: 73: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,426 INFO L273 TraceCheckUtils]: 74: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,427 INFO L273 TraceCheckUtils]: 76: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,427 INFO L273 TraceCheckUtils]: 77: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,427 INFO L273 TraceCheckUtils]: 78: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,427 INFO L273 TraceCheckUtils]: 79: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,427 INFO L273 TraceCheckUtils]: 80: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,428 INFO L273 TraceCheckUtils]: 81: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,428 INFO L273 TraceCheckUtils]: 82: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,428 INFO L273 TraceCheckUtils]: 83: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,428 INFO L273 TraceCheckUtils]: 84: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,428 INFO L273 TraceCheckUtils]: 85: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,429 INFO L273 TraceCheckUtils]: 86: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,429 INFO L273 TraceCheckUtils]: 87: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,429 INFO L273 TraceCheckUtils]: 88: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,429 INFO L273 TraceCheckUtils]: 89: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,429 INFO L273 TraceCheckUtils]: 90: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,430 INFO L273 TraceCheckUtils]: 91: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,430 INFO L273 TraceCheckUtils]: 92: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,430 INFO L273 TraceCheckUtils]: 93: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,430 INFO L273 TraceCheckUtils]: 94: Hoare triple {6842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {6842#false} is VALID [2018-11-23 12:02:50,430 INFO L273 TraceCheckUtils]: 95: Hoare triple {6842#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L273 TraceCheckUtils]: 96: Hoare triple {6842#false} assume !(~i~0 < 100000); {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L273 TraceCheckUtils]: 97: Hoare triple {6842#false} havoc ~x~0;~x~0 := 0; {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L273 TraceCheckUtils]: 98: Hoare triple {6842#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L256 TraceCheckUtils]: 99: Hoare triple {6842#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L273 TraceCheckUtils]: 100: Hoare triple {6842#false} ~cond := #in~cond; {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L273 TraceCheckUtils]: 101: Hoare triple {6842#false} assume 0 == ~cond; {6842#false} is VALID [2018-11-23 12:02:50,431 INFO L273 TraceCheckUtils]: 102: Hoare triple {6842#false} assume !false; {6842#false} is VALID [2018-11-23 12:02:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-23 12:02:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:02:50,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-11-23 12:02:50,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:50,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:02:50,536 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:02:50,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:02:50,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:02:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:50,537 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 16 states. [2018-11-23 12:02:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:51,279 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-11-23 12:02:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:02:51,279 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-11-23 12:02:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 149 transitions. [2018-11-23 12:02:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 149 transitions. [2018-11-23 12:02:51,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 149 transitions. [2018-11-23 12:02:52,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:52,130 INFO L225 Difference]: With dead ends: 207 [2018-11-23 12:02:52,130 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 12:02:52,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 12:02:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-11-23 12:02:52,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:52,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 115 states. [2018-11-23 12:02:52,183 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 115 states. [2018-11-23 12:02:52,183 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 115 states. [2018-11-23 12:02:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,185 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-11-23 12:02:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-23 12:02:52,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:52,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:52,186 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 118 states. [2018-11-23 12:02:52,186 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 118 states. [2018-11-23 12:02:52,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,189 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-11-23 12:02:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-23 12:02:52,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:52,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:52,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:52,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:02:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:02:52,192 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 103 [2018-11-23 12:02:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:52,193 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:02:52,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:02:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:02:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:02:52,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:52,194 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:52,195 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:52,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1628381432, now seen corresponding path program 12 times [2018-11-23 12:02:52,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:52,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:53,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {7891#true} call ULTIMATE.init(); {7891#true} is VALID [2018-11-23 12:02:53,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {7891#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7891#true} is VALID [2018-11-23 12:02:53,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {7891#true} assume true; {7891#true} is VALID [2018-11-23 12:02:53,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7891#true} {7891#true} #90#return; {7891#true} is VALID [2018-11-23 12:02:53,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {7891#true} call #t~ret9 := main(); {7891#true} is VALID [2018-11-23 12:02:53,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {7891#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7893#(= main_~i~0 0)} is VALID [2018-11-23 12:02:53,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {7893#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7894#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:53,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {7894#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7895#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:53,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {7895#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7896#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:53,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {7896#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7897#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:53,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {7897#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7898#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:53,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {7898#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7899#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:53,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {7899#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7900#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:53,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {7900#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7901#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:53,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {7901#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7902#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:53,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {7902#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7903#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:53,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {7903#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7904#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:53,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {7904#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7905#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:53,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {7905#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7906#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:53,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {7906#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7892#false} is VALID [2018-11-23 12:02:53,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {7892#false} ~i~0 := 0; {7892#false} is VALID [2018-11-23 12:02:53,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 35: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,828 INFO L273 TraceCheckUtils]: 36: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 38: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 39: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 40: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,830 INFO L273 TraceCheckUtils]: 44: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,830 INFO L273 TraceCheckUtils]: 45: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7892#false} is VALID [2018-11-23 12:02:53,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {7892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7892#false} is VALID [2018-11-23 12:02:53,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {7892#false} assume !(~i~0 < 100000); {7892#false} is VALID [2018-11-23 12:02:53,830 INFO L273 TraceCheckUtils]: 48: Hoare triple {7892#false} ~i~0 := 0; {7892#false} is VALID [2018-11-23 12:02:53,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 50: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 52: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 53: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,832 INFO L273 TraceCheckUtils]: 59: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,832 INFO L273 TraceCheckUtils]: 60: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,832 INFO L273 TraceCheckUtils]: 62: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 67: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 68: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,833 INFO L273 TraceCheckUtils]: 69: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,834 INFO L273 TraceCheckUtils]: 73: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7892#false} is VALID [2018-11-23 12:02:53,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {7892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7892#false} is VALID [2018-11-23 12:02:53,834 INFO L273 TraceCheckUtils]: 75: Hoare triple {7892#false} assume !(~i~0 < 100000); {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 76: Hoare triple {7892#false} ~i~0 := 0; {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 77: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 80: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 81: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,835 INFO L273 TraceCheckUtils]: 82: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,836 INFO L273 TraceCheckUtils]: 83: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,836 INFO L273 TraceCheckUtils]: 84: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,836 INFO L273 TraceCheckUtils]: 85: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,836 INFO L273 TraceCheckUtils]: 86: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,836 INFO L273 TraceCheckUtils]: 88: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,837 INFO L273 TraceCheckUtils]: 89: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,837 INFO L273 TraceCheckUtils]: 93: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,837 INFO L273 TraceCheckUtils]: 94: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 95: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 96: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 97: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 98: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 99: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 100: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,838 INFO L273 TraceCheckUtils]: 101: Hoare triple {7892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7892#false} is VALID [2018-11-23 12:02:53,839 INFO L273 TraceCheckUtils]: 102: Hoare triple {7892#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7892#false} is VALID [2018-11-23 12:02:53,839 INFO L273 TraceCheckUtils]: 103: Hoare triple {7892#false} assume !(~i~0 < 100000); {7892#false} is VALID [2018-11-23 12:02:53,839 INFO L273 TraceCheckUtils]: 104: Hoare triple {7892#false} havoc ~x~0;~x~0 := 0; {7892#false} is VALID [2018-11-23 12:02:53,839 INFO L273 TraceCheckUtils]: 105: Hoare triple {7892#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7892#false} is VALID [2018-11-23 12:02:53,839 INFO L256 TraceCheckUtils]: 106: Hoare triple {7892#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {7892#false} is VALID [2018-11-23 12:02:53,839 INFO L273 TraceCheckUtils]: 107: Hoare triple {7892#false} ~cond := #in~cond; {7892#false} is VALID [2018-11-23 12:02:53,840 INFO L273 TraceCheckUtils]: 108: Hoare triple {7892#false} assume 0 == ~cond; {7892#false} is VALID [2018-11-23 12:02:53,840 INFO L273 TraceCheckUtils]: 109: Hoare triple {7892#false} assume !false; {7892#false} is VALID [2018-11-23 12:02:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2018-11-23 12:02:53,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:53,851 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:02:53,862 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:54,657 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-23 12:03:54,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:54,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:55,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {7891#true} call ULTIMATE.init(); {7891#true} is VALID [2018-11-23 12:03:55,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {7891#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7891#true} is VALID [2018-11-23 12:03:55,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {7891#true} assume true; {7891#true} is VALID [2018-11-23 12:03:55,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7891#true} {7891#true} #90#return; {7891#true} is VALID [2018-11-23 12:03:55,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {7891#true} call #t~ret9 := main(); {7891#true} is VALID [2018-11-23 12:03:55,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {7891#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7891#true} is VALID [2018-11-23 12:03:55,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {7891#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7891#true} is VALID [2018-11-23 12:03:55,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {7891#true} assume !(~i~0 < 100000); {7891#true} is VALID [2018-11-23 12:03:55,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {7891#true} ~i~0 := 0; {7891#true} is VALID [2018-11-23 12:03:55,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,065 INFO L273 TraceCheckUtils]: 33: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,065 INFO L273 TraceCheckUtils]: 34: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,066 INFO L273 TraceCheckUtils]: 38: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,067 INFO L273 TraceCheckUtils]: 42: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,067 INFO L273 TraceCheckUtils]: 43: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,067 INFO L273 TraceCheckUtils]: 44: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,067 INFO L273 TraceCheckUtils]: 45: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7891#true} is VALID [2018-11-23 12:03:55,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {7891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7891#true} is VALID [2018-11-23 12:03:55,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {7891#true} assume !(~i~0 < 100000); {7891#true} is VALID [2018-11-23 12:03:55,068 INFO L273 TraceCheckUtils]: 48: Hoare triple {7891#true} ~i~0 := 0; {7891#true} is VALID [2018-11-23 12:03:55,068 INFO L273 TraceCheckUtils]: 49: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,068 INFO L273 TraceCheckUtils]: 50: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,069 INFO L273 TraceCheckUtils]: 52: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,069 INFO L273 TraceCheckUtils]: 53: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,069 INFO L273 TraceCheckUtils]: 54: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 55: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 56: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 58: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 59: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,071 INFO L273 TraceCheckUtils]: 60: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,071 INFO L273 TraceCheckUtils]: 61: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,071 INFO L273 TraceCheckUtils]: 62: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,071 INFO L273 TraceCheckUtils]: 63: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,071 INFO L273 TraceCheckUtils]: 64: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 65: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 66: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 67: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 68: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 69: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,073 INFO L273 TraceCheckUtils]: 70: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,073 INFO L273 TraceCheckUtils]: 71: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {7891#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7891#true} is VALID [2018-11-23 12:03:55,073 INFO L273 TraceCheckUtils]: 74: Hoare triple {7891#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7891#true} is VALID [2018-11-23 12:03:55,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {7891#true} assume !(~i~0 < 100000); {7891#true} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 76: Hoare triple {7891#true} ~i~0 := 0; {8138#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:55,100 INFO L273 TraceCheckUtils]: 77: Hoare triple {8138#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {8138#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:55,115 INFO L273 TraceCheckUtils]: 78: Hoare triple {8138#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7894#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:55,116 INFO L273 TraceCheckUtils]: 79: Hoare triple {7894#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7894#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:55,116 INFO L273 TraceCheckUtils]: 80: Hoare triple {7894#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7895#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:55,117 INFO L273 TraceCheckUtils]: 81: Hoare triple {7895#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7895#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:55,117 INFO L273 TraceCheckUtils]: 82: Hoare triple {7895#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7896#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:55,117 INFO L273 TraceCheckUtils]: 83: Hoare triple {7896#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7896#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:55,118 INFO L273 TraceCheckUtils]: 84: Hoare triple {7896#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7897#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:55,118 INFO L273 TraceCheckUtils]: 85: Hoare triple {7897#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7897#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:55,119 INFO L273 TraceCheckUtils]: 86: Hoare triple {7897#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7898#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:55,120 INFO L273 TraceCheckUtils]: 87: Hoare triple {7898#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7898#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:55,121 INFO L273 TraceCheckUtils]: 88: Hoare triple {7898#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7899#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:55,121 INFO L273 TraceCheckUtils]: 89: Hoare triple {7899#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7899#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:55,122 INFO L273 TraceCheckUtils]: 90: Hoare triple {7899#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7900#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:55,123 INFO L273 TraceCheckUtils]: 91: Hoare triple {7900#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7900#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:55,124 INFO L273 TraceCheckUtils]: 92: Hoare triple {7900#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7901#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:55,124 INFO L273 TraceCheckUtils]: 93: Hoare triple {7901#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7901#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:55,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {7901#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7902#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:55,126 INFO L273 TraceCheckUtils]: 95: Hoare triple {7902#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7902#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:55,127 INFO L273 TraceCheckUtils]: 96: Hoare triple {7902#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7903#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:55,127 INFO L273 TraceCheckUtils]: 97: Hoare triple {7903#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7903#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:55,128 INFO L273 TraceCheckUtils]: 98: Hoare triple {7903#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7904#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:55,129 INFO L273 TraceCheckUtils]: 99: Hoare triple {7904#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7904#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:55,130 INFO L273 TraceCheckUtils]: 100: Hoare triple {7904#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7905#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:55,130 INFO L273 TraceCheckUtils]: 101: Hoare triple {7905#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {7905#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:55,131 INFO L273 TraceCheckUtils]: 102: Hoare triple {7905#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7906#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:55,132 INFO L273 TraceCheckUtils]: 103: Hoare triple {7906#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7892#false} is VALID [2018-11-23 12:03:55,132 INFO L273 TraceCheckUtils]: 104: Hoare triple {7892#false} havoc ~x~0;~x~0 := 0; {7892#false} is VALID [2018-11-23 12:03:55,133 INFO L273 TraceCheckUtils]: 105: Hoare triple {7892#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7892#false} is VALID [2018-11-23 12:03:55,133 INFO L256 TraceCheckUtils]: 106: Hoare triple {7892#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {7892#false} is VALID [2018-11-23 12:03:55,133 INFO L273 TraceCheckUtils]: 107: Hoare triple {7892#false} ~cond := #in~cond; {7892#false} is VALID [2018-11-23 12:03:55,133 INFO L273 TraceCheckUtils]: 108: Hoare triple {7892#false} assume 0 == ~cond; {7892#false} is VALID [2018-11-23 12:03:55,134 INFO L273 TraceCheckUtils]: 109: Hoare triple {7892#false} assume !false; {7892#false} is VALID [2018-11-23 12:03:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-11-23 12:03:55,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:55,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:03:55,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-11-23 12:03:55,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:55,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:03:55,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:55,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:03:55,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:03:55,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:55,283 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 17 states. [2018-11-23 12:03:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:55,918 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2018-11-23 12:03:55,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:03:55,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-11-23 12:03:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 156 transitions. [2018-11-23 12:03:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 156 transitions. [2018-11-23 12:03:55,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 156 transitions. [2018-11-23 12:03:56,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:56,518 INFO L225 Difference]: With dead ends: 220 [2018-11-23 12:03:56,519 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:03:56,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:03:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-11-23 12:03:56,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:56,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 122 states. [2018-11-23 12:03:56,599 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 122 states. [2018-11-23 12:03:56,600 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 122 states. [2018-11-23 12:03:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:56,603 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:03:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:03:56,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:56,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:56,604 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 125 states. [2018-11-23 12:03:56,604 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 125 states. [2018-11-23 12:03:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:56,607 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:03:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:03:56,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:56,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:56,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:56,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 12:03:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-23 12:03:56,611 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 110 [2018-11-23 12:03:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:56,611 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-23 12:03:56,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:03:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-23 12:03:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 12:03:56,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:56,613 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:56,613 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:56,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash 674564954, now seen corresponding path program 13 times [2018-11-23 12:03:56,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:56,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:58,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {9008#true} call ULTIMATE.init(); {9008#true} is VALID [2018-11-23 12:03:58,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {9008#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9008#true} is VALID [2018-11-23 12:03:58,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {9008#true} assume true; {9008#true} is VALID [2018-11-23 12:03:58,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9008#true} {9008#true} #90#return; {9008#true} is VALID [2018-11-23 12:03:58,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {9008#true} call #t~ret9 := main(); {9008#true} is VALID [2018-11-23 12:03:58,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {9008#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9010#(= main_~i~0 0)} is VALID [2018-11-23 12:03:58,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {9010#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9011#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:58,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {9011#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9012#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:58,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {9012#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9013#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:58,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {9013#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9014#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:58,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {9014#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9015#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:58,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {9015#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9016#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:58,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {9016#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9017#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:58,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {9017#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9018#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:58,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {9018#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9019#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:58,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {9019#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9020#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:58,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {9020#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9021#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:58,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {9021#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9022#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:58,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {9022#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9023#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:58,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {9023#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9024#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:58,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {9024#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {9009#false} ~i~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,017 INFO L273 TraceCheckUtils]: 33: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,017 INFO L273 TraceCheckUtils]: 34: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,017 INFO L273 TraceCheckUtils]: 35: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,017 INFO L273 TraceCheckUtils]: 36: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,018 INFO L273 TraceCheckUtils]: 39: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,018 INFO L273 TraceCheckUtils]: 40: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,018 INFO L273 TraceCheckUtils]: 41: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,018 INFO L273 TraceCheckUtils]: 42: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,019 INFO L273 TraceCheckUtils]: 46: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,019 INFO L273 TraceCheckUtils]: 47: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,019 INFO L273 TraceCheckUtils]: 48: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {9009#false} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,020 INFO L273 TraceCheckUtils]: 51: Hoare triple {9009#false} ~i~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,020 INFO L273 TraceCheckUtils]: 52: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,020 INFO L273 TraceCheckUtils]: 53: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,020 INFO L273 TraceCheckUtils]: 54: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,021 INFO L273 TraceCheckUtils]: 55: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,021 INFO L273 TraceCheckUtils]: 56: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,021 INFO L273 TraceCheckUtils]: 57: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,021 INFO L273 TraceCheckUtils]: 58: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,021 INFO L273 TraceCheckUtils]: 59: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 61: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 62: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 63: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 66: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,022 INFO L273 TraceCheckUtils]: 67: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,023 INFO L273 TraceCheckUtils]: 68: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,023 INFO L273 TraceCheckUtils]: 69: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,023 INFO L273 TraceCheckUtils]: 71: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,023 INFO L273 TraceCheckUtils]: 72: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,024 INFO L273 TraceCheckUtils]: 74: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,024 INFO L273 TraceCheckUtils]: 75: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,024 INFO L273 TraceCheckUtils]: 76: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,024 INFO L273 TraceCheckUtils]: 77: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,024 INFO L273 TraceCheckUtils]: 78: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,024 INFO L273 TraceCheckUtils]: 79: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {9009#false} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,025 INFO L273 TraceCheckUtils]: 81: Hoare triple {9009#false} ~i~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,025 INFO L273 TraceCheckUtils]: 82: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,025 INFO L273 TraceCheckUtils]: 83: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,025 INFO L273 TraceCheckUtils]: 84: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,025 INFO L273 TraceCheckUtils]: 85: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 86: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 87: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 88: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 89: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 90: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 91: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 92: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,026 INFO L273 TraceCheckUtils]: 93: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 94: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 95: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 96: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 97: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 98: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 99: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 100: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,027 INFO L273 TraceCheckUtils]: 101: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 102: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 103: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 104: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 105: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 106: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 107: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 108: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,028 INFO L273 TraceCheckUtils]: 109: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L273 TraceCheckUtils]: 110: Hoare triple {9009#false} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L273 TraceCheckUtils]: 111: Hoare triple {9009#false} havoc ~x~0;~x~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L273 TraceCheckUtils]: 112: Hoare triple {9009#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L256 TraceCheckUtils]: 113: Hoare triple {9009#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L273 TraceCheckUtils]: 114: Hoare triple {9009#false} ~cond := #in~cond; {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L273 TraceCheckUtils]: 115: Hoare triple {9009#false} assume 0 == ~cond; {9009#false} is VALID [2018-11-23 12:03:58,029 INFO L273 TraceCheckUtils]: 116: Hoare triple {9009#false} assume !false; {9009#false} is VALID [2018-11-23 12:03:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-11-23 12:03:58,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:58,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:58,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:58,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:58,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {9008#true} call ULTIMATE.init(); {9008#true} is VALID [2018-11-23 12:03:58,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {9008#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9008#true} is VALID [2018-11-23 12:03:58,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {9008#true} assume true; {9008#true} is VALID [2018-11-23 12:03:58,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9008#true} {9008#true} #90#return; {9008#true} is VALID [2018-11-23 12:03:58,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {9008#true} call #t~ret9 := main(); {9008#true} is VALID [2018-11-23 12:03:58,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {9008#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9043#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:58,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {9043#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9011#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:58,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {9011#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9012#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:58,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {9012#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9013#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:58,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {9013#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9014#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:58,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {9014#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9015#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:58,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {9015#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9016#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:58,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {9016#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9017#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:58,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {9017#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9018#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:58,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {9018#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9019#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:58,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {9019#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9020#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:58,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {9020#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9021#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:58,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {9021#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9022#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:58,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {9022#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9023#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:58,389 INFO L273 TraceCheckUtils]: 19: Hoare triple {9023#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9024#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:58,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {9024#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {9009#false} ~i~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,391 INFO L273 TraceCheckUtils]: 30: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,392 INFO L273 TraceCheckUtils]: 32: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,392 INFO L273 TraceCheckUtils]: 33: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,392 INFO L273 TraceCheckUtils]: 34: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,392 INFO L273 TraceCheckUtils]: 35: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,393 INFO L273 TraceCheckUtils]: 36: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,393 INFO L273 TraceCheckUtils]: 39: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 44: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 45: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 46: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 47: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9009#false} is VALID [2018-11-23 12:03:58,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {9009#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 50: Hoare triple {9009#false} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {9009#false} ~i~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 54: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 55: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 56: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,395 INFO L273 TraceCheckUtils]: 57: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 58: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 59: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 60: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 61: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 62: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 63: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 64: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,396 INFO L273 TraceCheckUtils]: 66: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 67: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 68: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 69: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 70: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 71: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 72: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 73: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,397 INFO L273 TraceCheckUtils]: 74: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 75: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 76: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 77: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 78: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 79: Hoare triple {9009#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 80: Hoare triple {9009#false} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 81: Hoare triple {9009#false} ~i~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 84: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 85: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 86: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 87: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 88: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 89: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 90: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,399 INFO L273 TraceCheckUtils]: 91: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 92: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 93: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 94: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 95: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 97: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 98: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 99: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,400 INFO L273 TraceCheckUtils]: 100: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 101: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 102: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 103: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 104: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 105: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 106: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 107: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,401 INFO L273 TraceCheckUtils]: 108: Hoare triple {9009#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 109: Hoare triple {9009#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 110: Hoare triple {9009#false} assume !(~i~0 < 100000); {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 111: Hoare triple {9009#false} havoc ~x~0;~x~0 := 0; {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 112: Hoare triple {9009#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L256 TraceCheckUtils]: 113: Hoare triple {9009#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 114: Hoare triple {9009#false} ~cond := #in~cond; {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 115: Hoare triple {9009#false} assume 0 == ~cond; {9009#false} is VALID [2018-11-23 12:03:58,402 INFO L273 TraceCheckUtils]: 116: Hoare triple {9009#false} assume !false; {9009#false} is VALID [2018-11-23 12:03:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-11-23 12:03:58,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:03:58,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2018-11-23 12:03:58,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:58,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:03:58,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:58,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:03:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:03:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:58,462 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 18 states. [2018-11-23 12:03:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:59,610 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-11-23 12:03:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:03:59,610 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2018-11-23 12:03:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 12:03:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 12:03:59,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 163 transitions. [2018-11-23 12:03:59,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:59,899 INFO L225 Difference]: With dead ends: 233 [2018-11-23 12:03:59,899 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 12:03:59,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 12:04:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-11-23 12:04:00,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:00,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 129 states. [2018-11-23 12:04:00,013 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 129 states. [2018-11-23 12:04:00,013 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 129 states. [2018-11-23 12:04:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:00,016 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-23 12:04:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-23 12:04:00,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:00,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:00,016 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 132 states. [2018-11-23 12:04:00,017 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 132 states. [2018-11-23 12:04:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:00,019 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-23 12:04:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-23 12:04:00,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:00,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:00,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:00,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 12:04:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-23 12:04:00,023 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 117 [2018-11-23 12:04:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:00,023 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-23 12:04:00,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:04:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-23 12:04:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:04:00,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:00,025 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:00,025 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:00,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash -363733124, now seen corresponding path program 14 times [2018-11-23 12:04:00,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:00,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:00,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:00,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:00,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:00,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {10192#true} call ULTIMATE.init(); {10192#true} is VALID [2018-11-23 12:04:00,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {10192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10192#true} is VALID [2018-11-23 12:04:00,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {10192#true} assume true; {10192#true} is VALID [2018-11-23 12:04:00,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10192#true} {10192#true} #90#return; {10192#true} is VALID [2018-11-23 12:04:00,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {10192#true} call #t~ret9 := main(); {10192#true} is VALID [2018-11-23 12:04:00,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {10192#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10194#(= main_~i~0 0)} is VALID [2018-11-23 12:04:00,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {10194#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:00,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {10195#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10196#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:00,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {10196#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10197#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:00,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {10197#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10198#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:00,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10199#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:00,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {10199#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10200#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:00,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {10200#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10201#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:00,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {10201#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10202#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:00,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {10202#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10203#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:00,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {10203#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10204#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:00,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {10204#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:00,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {10205#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:00,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {10206#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10207#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:00,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {10207#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10208#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:00,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {10208#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10209#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:00,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {10209#(<= main_~i~0 15)} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:00,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {10193#false} ~i~0 := 0; {10193#false} is VALID [2018-11-23 12:04:00,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,746 INFO L273 TraceCheckUtils]: 27: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,748 INFO L273 TraceCheckUtils]: 35: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,750 INFO L273 TraceCheckUtils]: 44: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 51: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 52: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 53: Hoare triple {10193#false} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:00,751 INFO L273 TraceCheckUtils]: 54: Hoare triple {10193#false} ~i~0 := 0; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 55: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 58: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 59: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 60: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,752 INFO L273 TraceCheckUtils]: 62: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 63: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 64: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 65: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 66: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 68: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 69: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 74: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 75: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 76: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 77: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 78: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,754 INFO L273 TraceCheckUtils]: 79: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 80: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 81: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 82: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 83: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 84: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 85: Hoare triple {10193#false} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 86: Hoare triple {10193#false} ~i~0 := 0; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 87: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,755 INFO L273 TraceCheckUtils]: 88: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 89: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 90: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 91: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 92: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 93: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 94: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 95: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 96: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,756 INFO L273 TraceCheckUtils]: 97: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 98: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 99: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 100: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 101: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 102: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 103: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 104: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,757 INFO L273 TraceCheckUtils]: 105: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 106: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 107: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 108: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 109: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 110: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 111: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 112: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 113: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,758 INFO L273 TraceCheckUtils]: 114: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 115: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 116: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 117: Hoare triple {10193#false} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 118: Hoare triple {10193#false} havoc ~x~0;~x~0 := 0; {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 119: Hoare triple {10193#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L256 TraceCheckUtils]: 120: Hoare triple {10193#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 121: Hoare triple {10193#false} ~cond := #in~cond; {10193#false} is VALID [2018-11-23 12:04:00,759 INFO L273 TraceCheckUtils]: 122: Hoare triple {10193#false} assume 0 == ~cond; {10193#false} is VALID [2018-11-23 12:04:00,760 INFO L273 TraceCheckUtils]: 123: Hoare triple {10193#false} assume !false; {10193#false} is VALID [2018-11-23 12:04:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-11-23 12:04:00,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:00,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:00,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:00,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:00,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:01,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {10192#true} call ULTIMATE.init(); {10192#true} is VALID [2018-11-23 12:04:01,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {10192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10192#true} is VALID [2018-11-23 12:04:01,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {10192#true} assume true; {10192#true} is VALID [2018-11-23 12:04:01,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10192#true} {10192#true} #90#return; {10192#true} is VALID [2018-11-23 12:04:01,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {10192#true} call #t~ret9 := main(); {10192#true} is VALID [2018-11-23 12:04:01,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {10192#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10228#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:01,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {10228#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:01,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {10195#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10196#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:01,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {10196#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10197#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:01,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {10197#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10198#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:01,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10199#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:01,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {10199#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10200#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:01,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {10200#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10201#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:01,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {10201#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10202#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:01,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {10202#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10203#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:01,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {10203#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10204#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:01,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {10204#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:01,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {10205#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:01,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {10206#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10207#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:01,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {10207#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10208#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:01,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {10208#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10209#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:01,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {10209#(<= main_~i~0 15)} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:01,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {10193#false} ~i~0 := 0; {10193#false} is VALID [2018-11-23 12:04:01,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,148 INFO L273 TraceCheckUtils]: 28: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,152 INFO L273 TraceCheckUtils]: 48: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10193#false} is VALID [2018-11-23 12:04:01,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {10193#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10193#false} is VALID [2018-11-23 12:04:01,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {10193#false} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:01,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {10193#false} ~i~0 := 0; {10193#false} is VALID [2018-11-23 12:04:01,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,154 INFO L273 TraceCheckUtils]: 57: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,154 INFO L273 TraceCheckUtils]: 58: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,155 INFO L273 TraceCheckUtils]: 63: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,155 INFO L273 TraceCheckUtils]: 64: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,155 INFO L273 TraceCheckUtils]: 67: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,156 INFO L273 TraceCheckUtils]: 69: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,156 INFO L273 TraceCheckUtils]: 70: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,156 INFO L273 TraceCheckUtils]: 71: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,156 INFO L273 TraceCheckUtils]: 72: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,156 INFO L273 TraceCheckUtils]: 73: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,156 INFO L273 TraceCheckUtils]: 74: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,157 INFO L273 TraceCheckUtils]: 76: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,157 INFO L273 TraceCheckUtils]: 77: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,157 INFO L273 TraceCheckUtils]: 78: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,157 INFO L273 TraceCheckUtils]: 79: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,157 INFO L273 TraceCheckUtils]: 80: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10193#false} is VALID [2018-11-23 12:04:01,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {10193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10193#false} is VALID [2018-11-23 12:04:01,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {10193#false} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:01,158 INFO L273 TraceCheckUtils]: 86: Hoare triple {10193#false} ~i~0 := 0; {10193#false} is VALID [2018-11-23 12:04:01,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,159 INFO L273 TraceCheckUtils]: 92: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,160 INFO L273 TraceCheckUtils]: 93: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,160 INFO L273 TraceCheckUtils]: 94: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,160 INFO L273 TraceCheckUtils]: 95: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,160 INFO L273 TraceCheckUtils]: 96: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,160 INFO L273 TraceCheckUtils]: 98: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 99: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 100: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 101: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 103: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 104: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,161 INFO L273 TraceCheckUtils]: 105: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,162 INFO L273 TraceCheckUtils]: 106: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,162 INFO L273 TraceCheckUtils]: 107: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,162 INFO L273 TraceCheckUtils]: 108: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,162 INFO L273 TraceCheckUtils]: 109: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,162 INFO L273 TraceCheckUtils]: 110: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,162 INFO L273 TraceCheckUtils]: 111: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,163 INFO L273 TraceCheckUtils]: 112: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,163 INFO L273 TraceCheckUtils]: 113: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,163 INFO L273 TraceCheckUtils]: 114: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,163 INFO L273 TraceCheckUtils]: 115: Hoare triple {10193#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {10193#false} is VALID [2018-11-23 12:04:01,163 INFO L273 TraceCheckUtils]: 116: Hoare triple {10193#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10193#false} is VALID [2018-11-23 12:04:01,163 INFO L273 TraceCheckUtils]: 117: Hoare triple {10193#false} assume !(~i~0 < 100000); {10193#false} is VALID [2018-11-23 12:04:01,164 INFO L273 TraceCheckUtils]: 118: Hoare triple {10193#false} havoc ~x~0;~x~0 := 0; {10193#false} is VALID [2018-11-23 12:04:01,164 INFO L273 TraceCheckUtils]: 119: Hoare triple {10193#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10193#false} is VALID [2018-11-23 12:04:01,164 INFO L256 TraceCheckUtils]: 120: Hoare triple {10193#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {10193#false} is VALID [2018-11-23 12:04:01,164 INFO L273 TraceCheckUtils]: 121: Hoare triple {10193#false} ~cond := #in~cond; {10193#false} is VALID [2018-11-23 12:04:01,164 INFO L273 TraceCheckUtils]: 122: Hoare triple {10193#false} assume 0 == ~cond; {10193#false} is VALID [2018-11-23 12:04:01,164 INFO L273 TraceCheckUtils]: 123: Hoare triple {10193#false} assume !false; {10193#false} is VALID [2018-11-23 12:04:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-11-23 12:04:01,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:01,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:04:01,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 124 [2018-11-23 12:04:01,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:01,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:04:01,233 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 12:04:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:04:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:04:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:04:01,234 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 19 states. [2018-11-23 12:04:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:01,881 INFO L93 Difference]: Finished difference Result 246 states and 257 transitions. [2018-11-23 12:04:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:04:01,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 124 [2018-11-23 12:04:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:04:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 170 transitions. [2018-11-23 12:04:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:04:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 170 transitions. [2018-11-23 12:04:01,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 170 transitions. [2018-11-23 12:04:02,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:02,122 INFO L225 Difference]: With dead ends: 246 [2018-11-23 12:04:02,123 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:04:02,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:04:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:04:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-11-23 12:04:02,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:02,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 136 states. [2018-11-23 12:04:02,200 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 136 states. [2018-11-23 12:04:02,201 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 136 states. [2018-11-23 12:04:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:02,203 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:04:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:04:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:02,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:02,203 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 139 states. [2018-11-23 12:04:02,203 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 139 states. [2018-11-23 12:04:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:02,205 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 12:04:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:04:02,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:02,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:02,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:02,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:04:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2018-11-23 12:04:02,208 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 124 [2018-11-23 12:04:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:02,208 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2018-11-23 12:04:02,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:04:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-11-23 12:04:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 12:04:02,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:02,209 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:02,210 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:02,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1571697970, now seen corresponding path program 15 times [2018-11-23 12:04:02,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:02,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:02,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:03,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {11443#true} call ULTIMATE.init(); {11443#true} is VALID [2018-11-23 12:04:03,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {11443#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11443#true} is VALID [2018-11-23 12:04:03,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {11443#true} assume true; {11443#true} is VALID [2018-11-23 12:04:03,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11443#true} {11443#true} #90#return; {11443#true} is VALID [2018-11-23 12:04:03,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {11443#true} call #t~ret9 := main(); {11443#true} is VALID [2018-11-23 12:04:03,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {11443#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11445#(= main_~i~0 0)} is VALID [2018-11-23 12:04:03,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {11445#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11446#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:03,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {11446#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11447#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:03,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {11447#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11448#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:03,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {11448#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11449#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:03,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {11449#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11450#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:03,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {11450#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11451#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:03,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {11451#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11452#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:03,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {11452#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11453#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:03,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {11453#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11454#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:03,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {11454#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11455#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:03,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {11455#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11456#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:03,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {11456#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11457#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:03,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {11457#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11458#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:03,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {11458#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11459#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:03,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {11459#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11460#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:03,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {11460#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11461#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:03,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {11461#(<= main_~i~0 16)} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:03,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {11444#false} ~i~0 := 0; {11444#false} is VALID [2018-11-23 12:04:03,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 50: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 51: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:03,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 56: Hoare triple {11444#false} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 57: Hoare triple {11444#false} ~i~0 := 0; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 58: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 59: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 61: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 62: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 63: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,282 INFO L273 TraceCheckUtils]: 64: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 65: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 66: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 67: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 68: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 70: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 71: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,283 INFO L273 TraceCheckUtils]: 72: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 73: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 74: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 75: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 76: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 77: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 78: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 79: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 80: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,284 INFO L273 TraceCheckUtils]: 81: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 82: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 83: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 84: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 85: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 86: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 87: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 88: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 89: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:03,285 INFO L273 TraceCheckUtils]: 90: Hoare triple {11444#false} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 91: Hoare triple {11444#false} ~i~0 := 0; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 92: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 93: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 94: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 95: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 96: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 97: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 98: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,286 INFO L273 TraceCheckUtils]: 99: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 100: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 101: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 102: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 103: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 104: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 105: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 106: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,287 INFO L273 TraceCheckUtils]: 107: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 108: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 109: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 110: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 111: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 112: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 113: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 114: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 115: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,288 INFO L273 TraceCheckUtils]: 116: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 117: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 118: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 119: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 120: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 121: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 122: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 123: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:03,289 INFO L273 TraceCheckUtils]: 124: Hoare triple {11444#false} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:03,290 INFO L273 TraceCheckUtils]: 125: Hoare triple {11444#false} havoc ~x~0;~x~0 := 0; {11444#false} is VALID [2018-11-23 12:04:03,290 INFO L273 TraceCheckUtils]: 126: Hoare triple {11444#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11444#false} is VALID [2018-11-23 12:04:03,290 INFO L256 TraceCheckUtils]: 127: Hoare triple {11444#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {11444#false} is VALID [2018-11-23 12:04:03,290 INFO L273 TraceCheckUtils]: 128: Hoare triple {11444#false} ~cond := #in~cond; {11444#false} is VALID [2018-11-23 12:04:03,290 INFO L273 TraceCheckUtils]: 129: Hoare triple {11444#false} assume 0 == ~cond; {11444#false} is VALID [2018-11-23 12:04:03,290 INFO L273 TraceCheckUtils]: 130: Hoare triple {11444#false} assume !false; {11444#false} is VALID [2018-11-23 12:04:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2018-11-23 12:04:03,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:03,297 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:04:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:04:12,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:04:12,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:12,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:12,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {11443#true} call ULTIMATE.init(); {11443#true} is VALID [2018-11-23 12:04:12,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {11443#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11443#true} is VALID [2018-11-23 12:04:12,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {11443#true} assume true; {11443#true} is VALID [2018-11-23 12:04:12,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11443#true} {11443#true} #90#return; {11443#true} is VALID [2018-11-23 12:04:12,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {11443#true} call #t~ret9 := main(); {11443#true} is VALID [2018-11-23 12:04:12,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {11443#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11480#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:12,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {11480#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11446#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:12,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {11446#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11447#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:12,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {11447#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11448#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:12,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {11448#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11449#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:12,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {11449#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11450#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:12,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {11450#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11451#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:12,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {11451#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11452#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:12,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {11452#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11453#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:12,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {11453#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11454#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:12,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {11454#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11455#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:12,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {11455#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11456#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:12,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {11456#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11457#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:12,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {11457#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11458#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:12,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {11458#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11459#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:12,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {11459#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11460#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:12,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {11460#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11461#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:12,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {11461#(<= main_~i~0 16)} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:12,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {11444#false} ~i~0 := 0; {11444#false} is VALID [2018-11-23 12:04:12,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,476 INFO L273 TraceCheckUtils]: 36: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 38: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 39: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 40: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 45: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 50: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {11444#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 56: Hoare triple {11444#false} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {11444#false} ~i~0 := 0; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 60: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,479 INFO L273 TraceCheckUtils]: 61: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 62: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 65: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 66: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 67: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 68: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,480 INFO L273 TraceCheckUtils]: 69: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 71: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 72: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 73: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 74: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 75: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 76: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 77: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,481 INFO L273 TraceCheckUtils]: 78: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 79: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 81: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 82: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 83: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 85: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 86: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {11444#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 90: Hoare triple {11444#false} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 91: Hoare triple {11444#false} ~i~0 := 0; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 92: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 93: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 94: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,483 INFO L273 TraceCheckUtils]: 95: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 96: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 97: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 98: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 99: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 100: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,484 INFO L273 TraceCheckUtils]: 104: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 106: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 107: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 108: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 109: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 110: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 111: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 112: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,485 INFO L273 TraceCheckUtils]: 113: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 114: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 117: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 118: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 119: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {11444#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 123: Hoare triple {11444#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 124: Hoare triple {11444#false} assume !(~i~0 < 100000); {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 125: Hoare triple {11444#false} havoc ~x~0;~x~0 := 0; {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 126: Hoare triple {11444#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L256 TraceCheckUtils]: 127: Hoare triple {11444#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 128: Hoare triple {11444#false} ~cond := #in~cond; {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 129: Hoare triple {11444#false} assume 0 == ~cond; {11444#false} is VALID [2018-11-23 12:04:12,487 INFO L273 TraceCheckUtils]: 130: Hoare triple {11444#false} assume !false; {11444#false} is VALID [2018-11-23 12:04:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2018-11-23 12:04:12,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:12,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:04:12,518 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 131 [2018-11-23 12:04:12,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:12,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:04:12,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:12,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:04:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:04:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:04:12,553 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 20 states. [2018-11-23 12:04:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:13,639 INFO L93 Difference]: Finished difference Result 259 states and 270 transitions. [2018-11-23 12:04:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:04:13,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 131 [2018-11-23 12:04:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:04:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 177 transitions. [2018-11-23 12:04:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:04:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 177 transitions. [2018-11-23 12:04:13,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 177 transitions. [2018-11-23 12:04:13,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:13,828 INFO L225 Difference]: With dead ends: 259 [2018-11-23 12:04:13,828 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:04:13,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:04:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:04:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-11-23 12:04:13,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:13,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 143 states. [2018-11-23 12:04:13,932 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 143 states. [2018-11-23 12:04:13,933 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 143 states. [2018-11-23 12:04:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:13,936 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:04:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:04:13,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:13,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:13,937 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 146 states. [2018-11-23 12:04:13,937 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 146 states. [2018-11-23 12:04:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:13,940 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:04:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:04:13,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:13,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:13,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:13,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:04:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:04:13,944 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 131 [2018-11-23 12:04:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:13,944 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:04:13,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:04:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:04:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 12:04:13,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:13,946 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:13,946 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:13,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 985502192, now seen corresponding path program 16 times [2018-11-23 12:04:13,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:13,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:13,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:14,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {12761#true} call ULTIMATE.init(); {12761#true} is VALID [2018-11-23 12:04:14,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {12761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12761#true} is VALID [2018-11-23 12:04:14,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {12761#true} assume true; {12761#true} is VALID [2018-11-23 12:04:14,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12761#true} {12761#true} #90#return; {12761#true} is VALID [2018-11-23 12:04:14,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {12761#true} call #t~ret9 := main(); {12761#true} is VALID [2018-11-23 12:04:14,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {12761#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12763#(= main_~i~0 0)} is VALID [2018-11-23 12:04:14,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {12763#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12764#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:14,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {12764#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12765#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:14,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {12765#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12766#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:14,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {12766#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12767#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:14,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {12767#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12768#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:14,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {12768#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12769#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:14,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {12769#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12770#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:14,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {12770#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12771#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:14,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {12771#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12772#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:14,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {12772#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12773#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:14,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {12773#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12774#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:14,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {12774#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12775#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:14,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {12775#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12776#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:14,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {12776#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12777#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:14,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {12777#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12778#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:14,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {12778#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12779#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:14,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {12779#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:14,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {12780#(<= main_~i~0 17)} assume !(~i~0 < 100000); {12762#false} is VALID [2018-11-23 12:04:14,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {12762#false} ~i~0 := 0; {12762#false} is VALID [2018-11-23 12:04:14,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 36: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 37: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,477 INFO L273 TraceCheckUtils]: 50: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 54: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 55: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 56: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 57: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12762#false} is VALID [2018-11-23 12:04:14,478 INFO L273 TraceCheckUtils]: 58: Hoare triple {12762#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {12762#false} assume !(~i~0 < 100000); {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 60: Hoare triple {12762#false} ~i~0 := 0; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 61: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 63: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 64: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 65: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 66: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,479 INFO L273 TraceCheckUtils]: 67: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 68: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 69: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 70: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 71: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 72: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 73: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 74: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 75: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,480 INFO L273 TraceCheckUtils]: 76: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 77: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 78: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 79: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 80: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 81: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 82: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 84: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,481 INFO L273 TraceCheckUtils]: 85: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 86: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 88: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 89: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 90: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 91: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 92: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,482 INFO L273 TraceCheckUtils]: 93: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 94: Hoare triple {12762#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 95: Hoare triple {12762#false} assume !(~i~0 < 100000); {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 96: Hoare triple {12762#false} ~i~0 := 0; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 97: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 98: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 99: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 100: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 101: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,483 INFO L273 TraceCheckUtils]: 102: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 104: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 105: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 106: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 107: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 108: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 109: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 110: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,484 INFO L273 TraceCheckUtils]: 111: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 112: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 113: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 114: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 115: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 116: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 117: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 118: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,485 INFO L273 TraceCheckUtils]: 119: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 123: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 124: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 125: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 126: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 127: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,486 INFO L273 TraceCheckUtils]: 128: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 129: Hoare triple {12762#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 130: Hoare triple {12762#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 131: Hoare triple {12762#false} assume !(~i~0 < 100000); {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 132: Hoare triple {12762#false} havoc ~x~0;~x~0 := 0; {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 133: Hoare triple {12762#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L256 TraceCheckUtils]: 134: Hoare triple {12762#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 135: Hoare triple {12762#false} ~cond := #in~cond; {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 136: Hoare triple {12762#false} assume 0 == ~cond; {12762#false} is VALID [2018-11-23 12:04:14,487 INFO L273 TraceCheckUtils]: 137: Hoare triple {12762#false} assume !false; {12762#false} is VALID [2018-11-23 12:04:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2018-11-23 12:04:14,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:14,495 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:04:14,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:04:14,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:04:14,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:14,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:14,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {12761#true} call ULTIMATE.init(); {12761#true} is VALID [2018-11-23 12:04:14,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {12761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12761#true} is VALID [2018-11-23 12:04:14,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {12761#true} assume true; {12761#true} is VALID [2018-11-23 12:04:14,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12761#true} {12761#true} #90#return; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {12761#true} call #t~ret9 := main(); {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {12761#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {12761#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {12761#true} assume !(~i~0 < 100000); {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {12761#true} ~i~0 := 0; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 39: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 40: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 42: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 52: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 53: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 54: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,814 INFO L273 TraceCheckUtils]: 55: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 58: Hoare triple {12761#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 59: Hoare triple {12761#true} assume !(~i~0 < 100000); {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 60: Hoare triple {12761#true} ~i~0 := 0; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 61: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 62: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 63: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,815 INFO L273 TraceCheckUtils]: 64: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 65: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 66: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 67: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 71: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,816 INFO L273 TraceCheckUtils]: 72: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 73: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 74: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 76: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 77: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 78: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 79: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 80: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,817 INFO L273 TraceCheckUtils]: 81: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 82: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 83: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 84: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 85: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 86: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 87: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 88: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 89: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,818 INFO L273 TraceCheckUtils]: 90: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,819 INFO L273 TraceCheckUtils]: 91: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,819 INFO L273 TraceCheckUtils]: 92: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,819 INFO L273 TraceCheckUtils]: 93: Hoare triple {12761#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12761#true} is VALID [2018-11-23 12:04:14,819 INFO L273 TraceCheckUtils]: 94: Hoare triple {12761#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12761#true} is VALID [2018-11-23 12:04:14,819 INFO L273 TraceCheckUtils]: 95: Hoare triple {12761#true} assume !(~i~0 < 100000); {12761#true} is VALID [2018-11-23 12:04:14,820 INFO L273 TraceCheckUtils]: 96: Hoare triple {12761#true} ~i~0 := 0; {13072#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:14,820 INFO L273 TraceCheckUtils]: 97: Hoare triple {13072#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {13072#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:14,822 INFO L273 TraceCheckUtils]: 98: Hoare triple {13072#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12764#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:14,822 INFO L273 TraceCheckUtils]: 99: Hoare triple {12764#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12764#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:14,824 INFO L273 TraceCheckUtils]: 100: Hoare triple {12764#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12765#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:14,824 INFO L273 TraceCheckUtils]: 101: Hoare triple {12765#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12765#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:14,828 INFO L273 TraceCheckUtils]: 102: Hoare triple {12765#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12766#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:14,830 INFO L273 TraceCheckUtils]: 103: Hoare triple {12766#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12766#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:14,830 INFO L273 TraceCheckUtils]: 104: Hoare triple {12766#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12767#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:14,833 INFO L273 TraceCheckUtils]: 105: Hoare triple {12767#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12767#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:14,834 INFO L273 TraceCheckUtils]: 106: Hoare triple {12767#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12768#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:14,834 INFO L273 TraceCheckUtils]: 107: Hoare triple {12768#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12768#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:14,834 INFO L273 TraceCheckUtils]: 108: Hoare triple {12768#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12769#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:14,835 INFO L273 TraceCheckUtils]: 109: Hoare triple {12769#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12769#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:14,835 INFO L273 TraceCheckUtils]: 110: Hoare triple {12769#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12770#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:14,835 INFO L273 TraceCheckUtils]: 111: Hoare triple {12770#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12770#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:14,836 INFO L273 TraceCheckUtils]: 112: Hoare triple {12770#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12771#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:14,837 INFO L273 TraceCheckUtils]: 113: Hoare triple {12771#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12771#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:14,837 INFO L273 TraceCheckUtils]: 114: Hoare triple {12771#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12772#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:14,838 INFO L273 TraceCheckUtils]: 115: Hoare triple {12772#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12772#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:14,839 INFO L273 TraceCheckUtils]: 116: Hoare triple {12772#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12773#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:14,839 INFO L273 TraceCheckUtils]: 117: Hoare triple {12773#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12773#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:14,840 INFO L273 TraceCheckUtils]: 118: Hoare triple {12773#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12774#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:14,840 INFO L273 TraceCheckUtils]: 119: Hoare triple {12774#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12774#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:14,841 INFO L273 TraceCheckUtils]: 120: Hoare triple {12774#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12775#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:14,842 INFO L273 TraceCheckUtils]: 121: Hoare triple {12775#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12775#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:14,863 INFO L273 TraceCheckUtils]: 122: Hoare triple {12775#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12776#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:14,870 INFO L273 TraceCheckUtils]: 123: Hoare triple {12776#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12776#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:14,871 INFO L273 TraceCheckUtils]: 124: Hoare triple {12776#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12777#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:14,872 INFO L273 TraceCheckUtils]: 125: Hoare triple {12777#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12777#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:14,872 INFO L273 TraceCheckUtils]: 126: Hoare triple {12777#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12778#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:14,874 INFO L273 TraceCheckUtils]: 127: Hoare triple {12778#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12778#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:14,874 INFO L273 TraceCheckUtils]: 128: Hoare triple {12778#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12779#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:14,876 INFO L273 TraceCheckUtils]: 129: Hoare triple {12779#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {12779#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:14,876 INFO L273 TraceCheckUtils]: 130: Hoare triple {12779#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12780#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:14,877 INFO L273 TraceCheckUtils]: 131: Hoare triple {12780#(<= main_~i~0 17)} assume !(~i~0 < 100000); {12762#false} is VALID [2018-11-23 12:04:14,877 INFO L273 TraceCheckUtils]: 132: Hoare triple {12762#false} havoc ~x~0;~x~0 := 0; {12762#false} is VALID [2018-11-23 12:04:14,877 INFO L273 TraceCheckUtils]: 133: Hoare triple {12762#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12762#false} is VALID [2018-11-23 12:04:14,877 INFO L256 TraceCheckUtils]: 134: Hoare triple {12762#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {12762#false} is VALID [2018-11-23 12:04:14,877 INFO L273 TraceCheckUtils]: 135: Hoare triple {12762#false} ~cond := #in~cond; {12762#false} is VALID [2018-11-23 12:04:14,877 INFO L273 TraceCheckUtils]: 136: Hoare triple {12762#false} assume 0 == ~cond; {12762#false} is VALID [2018-11-23 12:04:14,877 INFO L273 TraceCheckUtils]: 137: Hoare triple {12762#false} assume !false; {12762#false} is VALID [2018-11-23 12:04:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2018-11-23 12:04:14,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:04:14,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2018-11-23 12:04:14,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:14,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:04:14,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:14,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:04:14,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:04:14,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:04:14,999 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 21 states. [2018-11-23 12:04:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:15,888 INFO L93 Difference]: Finished difference Result 272 states and 283 transitions. [2018-11-23 12:04:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:04:15,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2018-11-23 12:04:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:04:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 184 transitions. [2018-11-23 12:04:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:04:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 184 transitions. [2018-11-23 12:04:15,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 184 transitions. [2018-11-23 12:04:16,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:16,288 INFO L225 Difference]: With dead ends: 272 [2018-11-23 12:04:16,288 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:04:16,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:04:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:04:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-11-23 12:04:16,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:16,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 150 states. [2018-11-23 12:04:16,368 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 150 states. [2018-11-23 12:04:16,368 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 150 states. [2018-11-23 12:04:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:16,371 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:04:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:04:16,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:16,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:16,371 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 153 states. [2018-11-23 12:04:16,371 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 153 states. [2018-11-23 12:04:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:16,373 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:04:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:04:16,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:16,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:16,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:16,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 12:04:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-11-23 12:04:16,377 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 138 [2018-11-23 12:04:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:16,377 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-11-23 12:04:16,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:04:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-23 12:04:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 12:04:16,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:16,378 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:16,379 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:16,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 941702210, now seen corresponding path program 17 times [2018-11-23 12:04:16,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:16,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:16,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:16,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:16,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {14146#true} call ULTIMATE.init(); {14146#true} is VALID [2018-11-23 12:04:16,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {14146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14146#true} is VALID [2018-11-23 12:04:16,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {14146#true} assume true; {14146#true} is VALID [2018-11-23 12:04:16,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14146#true} {14146#true} #90#return; {14146#true} is VALID [2018-11-23 12:04:16,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {14146#true} call #t~ret9 := main(); {14146#true} is VALID [2018-11-23 12:04:16,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {14146#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14148#(= main_~i~0 0)} is VALID [2018-11-23 12:04:16,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {14148#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14149#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:16,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {14149#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14150#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:16,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {14150#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14151#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:16,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {14151#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14152#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:16,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {14152#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14153#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:16,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {14153#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14154#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:16,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {14154#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14155#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:16,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {14155#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14156#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:16,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {14156#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14157#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:16,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {14157#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14158#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:16,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {14158#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14159#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:16,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {14159#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14160#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:16,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {14160#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14161#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:16,775 INFO L273 TraceCheckUtils]: 19: Hoare triple {14161#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14162#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:16,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {14162#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14163#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:16,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {14163#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14164#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:16,777 INFO L273 TraceCheckUtils]: 22: Hoare triple {14164#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14165#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:16,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {14165#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14166#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:16,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {14166#(<= main_~i~0 18)} assume !(~i~0 < 100000); {14147#false} is VALID [2018-11-23 12:04:16,779 INFO L273 TraceCheckUtils]: 25: Hoare triple {14147#false} ~i~0 := 0; {14147#false} is VALID [2018-11-23 12:04:16,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 43: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 51: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 52: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 53: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 56: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 57: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 58: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 59: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 60: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 61: Hoare triple {14147#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14147#false} is VALID [2018-11-23 12:04:16,784 INFO L273 TraceCheckUtils]: 62: Hoare triple {14147#false} assume !(~i~0 < 100000); {14147#false} is VALID [2018-11-23 12:04:16,785 INFO L273 TraceCheckUtils]: 63: Hoare triple {14147#false} ~i~0 := 0; {14147#false} is VALID [2018-11-23 12:04:16,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,785 INFO L273 TraceCheckUtils]: 65: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,786 INFO L273 TraceCheckUtils]: 69: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,786 INFO L273 TraceCheckUtils]: 70: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,786 INFO L273 TraceCheckUtils]: 71: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,786 INFO L273 TraceCheckUtils]: 72: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,786 INFO L273 TraceCheckUtils]: 73: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 78: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 79: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,787 INFO L273 TraceCheckUtils]: 80: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 81: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 83: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 88: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,788 INFO L273 TraceCheckUtils]: 89: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 90: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 91: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 93: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,789 INFO L273 TraceCheckUtils]: 98: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {14147#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 100: Hoare triple {14147#false} assume !(~i~0 < 100000); {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 101: Hoare triple {14147#false} ~i~0 := 0; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 105: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 106: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,790 INFO L273 TraceCheckUtils]: 107: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 108: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 109: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 110: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 114: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,791 INFO L273 TraceCheckUtils]: 115: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 116: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 117: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 118: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 119: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 123: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,792 INFO L273 TraceCheckUtils]: 124: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 127: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 128: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 129: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 130: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 131: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 132: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,793 INFO L273 TraceCheckUtils]: 133: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 135: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 136: Hoare triple {14147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 - #t~mem6, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem6;havoc #t~mem5; {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 137: Hoare triple {14147#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 138: Hoare triple {14147#false} assume !(~i~0 < 100000); {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 139: Hoare triple {14147#false} havoc ~x~0;~x~0 := 0; {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 140: Hoare triple {14147#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L256 TraceCheckUtils]: 141: Hoare triple {14147#false} call __VERIFIER_assert((if #t~mem8 == ~x~0 then 1 else 0)); {14147#false} is VALID [2018-11-23 12:04:16,794 INFO L273 TraceCheckUtils]: 142: Hoare triple {14147#false} ~cond := #in~cond; {14147#false} is VALID [2018-11-23 12:04:16,795 INFO L273 TraceCheckUtils]: 143: Hoare triple {14147#false} assume 0 == ~cond; {14147#false} is VALID [2018-11-23 12:04:16,795 INFO L273 TraceCheckUtils]: 144: Hoare triple {14147#false} assume !false; {14147#false} is VALID [2018-11-23 12:04:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-11-23 12:04:16,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:16,803 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:04:16,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1