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_init7_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:21,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:21,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:21,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:21,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:21,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:21,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:21,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:21,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:21,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:21,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:21,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:21,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:21,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:21,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:21,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:21,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:21,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:21,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:21,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:21,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:21,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:21,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:21,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:21,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:21,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:21,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:21,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:21,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:21,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:21,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:21,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:21,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:21,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:21,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:21,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:21,320 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:21,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:21,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:21,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:21,348 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:21,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:21,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:21,349 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:21,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:21,350 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:21,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:21,350 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:21,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:21,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:21,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:21,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:21,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:21,351 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:21,352 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:21,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:21,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:21,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:21,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:21,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:21,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:21,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:21,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:21,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:21,354 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:21,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:21,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:21,354 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:21,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:21,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:21,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:21,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:21,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:21,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init7_false-unreach-call_ground.i [2018-11-23 11:55:21,483 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68220db02/289a5b3c51e9458c9bb06a7d61ee6a1f/FLAG89a4e9778 [2018-11-23 11:55:21,947 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:21,948 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init7_false-unreach-call_ground.i [2018-11-23 11:55:21,957 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68220db02/289a5b3c51e9458c9bb06a7d61ee6a1f/FLAG89a4e9778 [2018-11-23 11:55:22,305 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68220db02/289a5b3c51e9458c9bb06a7d61ee6a1f [2018-11-23 11:55:22,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:22,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:22,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:22,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:22,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:22,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b547f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22, skipping insertion in model container [2018-11-23 11:55:22,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:22,359 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:22,569 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:22,574 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:22,603 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:22,628 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:22,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22 WrapperNode [2018-11-23 11:55:22,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:22,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:22,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:22,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:22,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:22,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:22,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:22,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:22,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... [2018-11-23 11:55:22,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:22,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:22,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:22,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:22,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:23,486 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:23,486 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:55:23,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:23 BoogieIcfgContainer [2018-11-23 11:55:23,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:23,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:23,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:23,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:23,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:22" (1/3) ... [2018-11-23 11:55:23,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9176a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:23, skipping insertion in model container [2018-11-23 11:55:23,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:22" (2/3) ... [2018-11-23 11:55:23,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9176a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:23, skipping insertion in model container [2018-11-23 11:55:23,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:23" (3/3) ... [2018-11-23 11:55:23,495 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init7_false-unreach-call_ground.i [2018-11-23 11:55:23,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:23,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:23,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:23,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:23,561 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:23,561 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:23,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:23,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:23,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:23,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:23,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:23,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 11:55:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:23,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:23,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:23,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:23,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash -190793262, now seen corresponding path program 1 times [2018-11-23 11:55:23,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:23,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:23,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 11:55:23,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38#true} is VALID [2018-11-23 11:55:23,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 11:55:23,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #126#return; {38#true} is VALID [2018-11-23 11:55:23,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret2 := main(); {38#true} is VALID [2018-11-23 11:55:23,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {38#true} is VALID [2018-11-23 11:55:23,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 11:55:23,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 11:55:23,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 11:55:23,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 11:55:23,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 11:55:23,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 11:55:23,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 11:55:23,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {39#false} havoc ~x~0;~x~0 := 0; {39#false} is VALID [2018-11-23 11:55:23,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39#false} is VALID [2018-11-23 11:55:23,815 INFO L256 TraceCheckUtils]: 21: Hoare triple {39#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {39#false} is VALID [2018-11-23 11:55:23,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 11:55:23,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2018-11-23 11:55:23,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 11:55:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:23,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:23,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:23,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 11:55:23,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:23,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:23,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:23,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:24,000 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 11:55:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,278 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-11-23 11:55:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:24,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 11:55:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-23 11:55:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-23 11:55:24,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2018-11-23 11:55:24,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:24,555 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:55:24,555 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:55:24,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:55:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 11:55:24,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:24,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:24,703 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:24,704 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,709 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:55:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:55:24,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,710 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:24,711 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,719 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:55:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:55:24,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:24,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:55:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 11:55:24,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 25 [2018-11-23 11:55:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:24,726 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 11:55:24,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:55:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:24,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:24,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:24,728 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:24,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1826977482, now seen corresponding path program 1 times [2018-11-23 11:55:24,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:24,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2018-11-23 11:55:24,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {232#true} is VALID [2018-11-23 11:55:24,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2018-11-23 11:55:24,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #126#return; {232#true} is VALID [2018-11-23 11:55:24,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret2 := main(); {232#true} is VALID [2018-11-23 11:55:24,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {232#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {234#(= main_~i~0 0)} is VALID [2018-11-23 11:55:24,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(= main_~i~0 0)} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 11:55:24,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {233#false} havoc ~x~0;~x~0 := 0; {233#false} is VALID [2018-11-23 11:55:24,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {233#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {233#false} is VALID [2018-11-23 11:55:24,822 INFO L256 TraceCheckUtils]: 21: Hoare triple {233#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {233#false} is VALID [2018-11-23 11:55:24,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {233#false} ~cond := #in~cond; {233#false} is VALID [2018-11-23 11:55:24,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {233#false} assume 0 == ~cond; {233#false} is VALID [2018-11-23 11:55:24,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {233#false} assume !false; {233#false} is VALID [2018-11-23 11:55:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:24,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:24,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:24,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:55:24,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:24,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:55:25,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:25,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:25,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:25,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:25,053 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2018-11-23 11:55:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,484 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-23 11:55:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:25,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:55:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-23 11:55:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-23 11:55:25,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2018-11-23 11:55:25,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:25,684 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:55:25,684 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:55:25,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:55:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:55:25,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:25,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:25,715 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:25,715 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,719 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 11:55:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:55:25,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,720 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:25,720 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,724 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 11:55:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:55:25,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:25,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:55:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 11:55:25,728 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2018-11-23 11:55:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:25,728 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 11:55:25,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:55:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:55:25,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:25,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:25,730 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:25,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1635964633, now seen corresponding path program 1 times [2018-11-23 11:55:25,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 11:55:25,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {459#true} is VALID [2018-11-23 11:55:25,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 11:55:25,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #126#return; {459#true} is VALID [2018-11-23 11:55:25,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret2 := main(); {459#true} is VALID [2018-11-23 11:55:25,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {461#(= main_~i~0 0)} is VALID [2018-11-23 11:55:25,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= 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; {462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#(<= main_~i~0 1)} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:25,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:25,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:25,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:25,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:25,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:25,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:25,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {460#false} havoc ~x~0;~x~0 := 0; {460#false} is VALID [2018-11-23 11:55:25,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {460#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {460#false} is VALID [2018-11-23 11:55:25,924 INFO L256 TraceCheckUtils]: 28: Hoare triple {460#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {460#false} is VALID [2018-11-23 11:55:25,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2018-11-23 11:55:25,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {460#false} assume 0 == ~cond; {460#false} is VALID [2018-11-23 11:55:25,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 11:55:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:55:25,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:25,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:25,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:26,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 11:55:26,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {459#true} is VALID [2018-11-23 11:55:26,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 11:55:26,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #126#return; {459#true} is VALID [2018-11-23 11:55:26,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret2 := main(); {459#true} is VALID [2018-11-23 11:55:26,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {481#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:26,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {481#(<= 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; {462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:26,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#(<= main_~i~0 1)} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:26,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:26,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:26,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:26,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:26,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 11:55:26,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 11:55:26,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {460#false} havoc ~x~0;~x~0 := 0; {460#false} is VALID [2018-11-23 11:55:26,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {460#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {460#false} is VALID [2018-11-23 11:55:26,338 INFO L256 TraceCheckUtils]: 28: Hoare triple {460#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {460#false} is VALID [2018-11-23 11:55:26,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2018-11-23 11:55:26,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {460#false} assume 0 == ~cond; {460#false} is VALID [2018-11-23 11:55:26,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 11:55:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:55:26,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:26,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:26,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 11:55:26,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:26,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:26,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:26,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:26,443 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 5 states. [2018-11-23 11:55:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,851 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 11:55:26,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:26,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 11:55:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 11:55:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 11:55:26,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-23 11:55:27,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,058 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:55:27,058 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:55:27,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:55:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 11:55:27,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:27,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:27,146 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:27,146 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,149 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 11:55:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 11:55:27,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,150 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:27,150 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,153 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 11:55:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 11:55:27,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:27,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:55:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 11:55:27,157 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 32 [2018-11-23 11:55:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:27,158 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 11:55:27,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 11:55:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:55:27,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:27,160 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:27,160 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:27,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1768739882, now seen corresponding path program 2 times [2018-11-23 11:55:27,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 11:55:27,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {835#true} is VALID [2018-11-23 11:55:27,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:55:27,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #126#return; {835#true} is VALID [2018-11-23 11:55:27,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret2 := main(); {835#true} is VALID [2018-11-23 11:55:27,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {837#(= main_~i~0 0)} is VALID [2018-11-23 11:55:27,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {837#(= 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; {838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {838#(<= 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; {839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:27,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {839#(<= main_~i~0 2)} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {836#false} havoc ~x~0;~x~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {836#false} is VALID [2018-11-23 11:55:27,347 INFO L256 TraceCheckUtils]: 35: Hoare triple {836#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {836#false} is VALID [2018-11-23 11:55:27,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 11:55:27,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 11:55:27,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 11:55:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:55:27,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:27,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:27,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:27,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:27,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 11:55:27,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {835#true} is VALID [2018-11-23 11:55:27,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:55:27,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #126#return; {835#true} is VALID [2018-11-23 11:55:27,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret2 := main(); {835#true} is VALID [2018-11-23 11:55:27,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {858#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {858#(<= 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; {838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {838#(<= 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; {839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:27,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {839#(<= main_~i~0 2)} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 11:55:27,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 11:55:27,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {836#false} havoc ~x~0;~x~0 := 0; {836#false} is VALID [2018-11-23 11:55:27,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {836#false} is VALID [2018-11-23 11:55:27,524 INFO L256 TraceCheckUtils]: 35: Hoare triple {836#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {836#false} is VALID [2018-11-23 11:55:27,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 11:55:27,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 11:55:27,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 11:55:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:55:27,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:27,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:27,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-23 11:55:27,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:27,594 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 11:55:27,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:27,595 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 6 states. [2018-11-23 11:55:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,075 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2018-11-23 11:55:28,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:28,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-23 11:55:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-23 11:55:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-23 11:55:28,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2018-11-23 11:55:28,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,201 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:55:28,201 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:55:28,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:55:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 11:55:28,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:28,274 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:28,275 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,277 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 11:55:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 11:55:28,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,279 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:28,279 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,282 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 11:55:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 11:55:28,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:55:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 11:55:28,286 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 39 [2018-11-23 11:55:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,286 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 11:55:28,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 11:55:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:55:28,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,288 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,288 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1394041657, now seen corresponding path program 3 times [2018-11-23 11:55:28,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1287#true} is VALID [2018-11-23 11:55:28,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1287#true} is VALID [2018-11-23 11:55:28,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-23 11:55:28,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #126#return; {1287#true} is VALID [2018-11-23 11:55:28,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret2 := main(); {1287#true} is VALID [2018-11-23 11:55:28,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {1287#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1289#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {1289#(= 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; {1290#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {1290#(<= 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; {1291#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {1291#(<= 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; {1292#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:28,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {1292#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,474 INFO L273 TraceCheckUtils]: 34: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {1288#false} havoc ~x~0;~x~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1288#false} is VALID [2018-11-23 11:55:28,477 INFO L256 TraceCheckUtils]: 42: Hoare triple {1288#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1288#false} is VALID [2018-11-23 11:55:28,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {1288#false} ~cond := #in~cond; {1288#false} is VALID [2018-11-23 11:55:28,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {1288#false} assume 0 == ~cond; {1288#false} is VALID [2018-11-23 11:55:28,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2018-11-23 11:55:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:55:28,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:28,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:28,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:28,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:55:28,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:28,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1287#true} is VALID [2018-11-23 11:55:28,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1287#true} is VALID [2018-11-23 11:55:28,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-23 11:55:28,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #126#return; {1287#true} is VALID [2018-11-23 11:55:28,746 INFO L256 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret2 := main(); {1287#true} is VALID [2018-11-23 11:55:28,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {1287#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1287#true} is VALID [2018-11-23 11:55:28,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 11:55:28,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 11:55:28,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 11:55:28,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 11:55:28,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 11:55:28,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 11:55:28,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 11:55:28,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 11:55:28,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 11:55:28,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 11:55:28,767 INFO L273 TraceCheckUtils]: 30: Hoare triple {1287#true} ~i~0 := 0; {1386#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:28,782 INFO L273 TraceCheckUtils]: 31: Hoare triple {1386#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1290#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {1290#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {1291#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1292#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:28,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {1292#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,792 INFO L273 TraceCheckUtils]: 37: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,793 INFO L273 TraceCheckUtils]: 38: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 11:55:28,793 INFO L273 TraceCheckUtils]: 39: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 11:55:28,793 INFO L273 TraceCheckUtils]: 40: Hoare triple {1288#false} havoc ~x~0;~x~0 := 0; {1288#false} is VALID [2018-11-23 11:55:28,793 INFO L273 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1288#false} is VALID [2018-11-23 11:55:28,793 INFO L256 TraceCheckUtils]: 42: Hoare triple {1288#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1288#false} is VALID [2018-11-23 11:55:28,794 INFO L273 TraceCheckUtils]: 43: Hoare triple {1288#false} ~cond := #in~cond; {1288#false} is VALID [2018-11-23 11:55:28,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {1288#false} assume 0 == ~cond; {1288#false} is VALID [2018-11-23 11:55:28,794 INFO L273 TraceCheckUtils]: 45: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2018-11-23 11:55:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:55:28,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:28,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:55:28,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 11:55:28,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:28,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:55:28,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:55:28,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:55:28,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:28,905 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2018-11-23 11:55:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,253 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2018-11-23 11:55:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:29,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 11:55:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 11:55:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 11:55:29,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2018-11-23 11:55:29,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,515 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:55:29,515 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:55:29,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:55:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:55:29,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:29,582 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:29,582 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,585 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 11:55:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 11:55:29,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,586 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:29,586 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,589 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 11:55:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 11:55:29,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:55:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-23 11:55:29,594 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 46 [2018-11-23 11:55:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,594 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-23 11:55:29,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:55:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 11:55:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:55:29,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,596 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,596 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1002468982, now seen corresponding path program 4 times [2018-11-23 11:55:29,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:29,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 11:55:29,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 11:55:29,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 11:55:29,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #126#return; {1815#true} is VALID [2018-11-23 11:55:29,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 11:55:29,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1817#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {1817#(= 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; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= 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; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= 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; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= 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; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:29,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,777 INFO L273 TraceCheckUtils]: 22: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,777 INFO L273 TraceCheckUtils]: 25: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 34: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 36: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,780 INFO L273 TraceCheckUtils]: 38: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:29,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:29,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 11:55:29,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 11:55:29,781 INFO L256 TraceCheckUtils]: 49: Hoare triple {1816#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 11:55:29,782 INFO L273 TraceCheckUtils]: 50: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 11:55:29,782 INFO L273 TraceCheckUtils]: 51: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 11:55:29,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 11:55:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 11:55:29,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:29,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:29,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:29,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 11:55:30,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 11:55:30,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 11:55:30,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #126#return; {1815#true} is VALID [2018-11-23 11:55:30,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 11:55:30,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1840#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {1840#(<= 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; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= 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; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= 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; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= 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; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,264 INFO L273 TraceCheckUtils]: 38: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,265 INFO L273 TraceCheckUtils]: 42: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,265 INFO L273 TraceCheckUtils]: 43: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 11:55:30,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:55:30,266 INFO L273 TraceCheckUtils]: 47: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 11:55:30,267 INFO L273 TraceCheckUtils]: 48: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 11:55:30,267 INFO L256 TraceCheckUtils]: 49: Hoare triple {1816#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 11:55:30,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 11:55:30,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 11:55:30,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 11:55:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 11:55:30,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:55:30,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 11:55:30,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:55:30,371 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 11:55:30,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:30,372 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 8 states. [2018-11-23 11:55:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,229 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-11-23 11:55:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:31,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 11:55:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-11-23 11:55:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-11-23 11:55:31,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 108 transitions. [2018-11-23 11:55:31,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,546 INFO L225 Difference]: With dead ends: 112 [2018-11-23 11:55:31,546 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:55:31,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:55:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 11:55:31,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:31,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:31,597 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:31,597 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,600 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 11:55:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 11:55:31,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,600 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:31,601 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,603 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 11:55:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 11:55:31,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:31,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:55:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-23 11:55:31,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 53 [2018-11-23 11:55:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:31,607 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-23 11:55:31,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 11:55:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 11:55:31,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:31,608 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:31,608 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:31,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash 451754087, now seen corresponding path program 5 times [2018-11-23 11:55:31,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {2419#true} call ULTIMATE.init(); {2419#true} is VALID [2018-11-23 11:55:31,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {2419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2419#true} is VALID [2018-11-23 11:55:31,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {2419#true} assume true; {2419#true} is VALID [2018-11-23 11:55:31,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2419#true} {2419#true} #126#return; {2419#true} is VALID [2018-11-23 11:55:31,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {2419#true} call #t~ret2 := main(); {2419#true} is VALID [2018-11-23 11:55:31,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {2419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2421#(= main_~i~0 0)} is VALID [2018-11-23 11:55:31,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {2421#(= 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; {2422#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {2422#(<= 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; {2423#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {2423#(<= 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; {2424#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {2424#(<= 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; {2425#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {2425#(<= 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; {2426#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:31,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {2426#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 27: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 31: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 32: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 42: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,799 INFO L273 TraceCheckUtils]: 43: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,800 INFO L273 TraceCheckUtils]: 44: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,800 INFO L273 TraceCheckUtils]: 45: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,800 INFO L273 TraceCheckUtils]: 46: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,800 INFO L273 TraceCheckUtils]: 47: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,800 INFO L273 TraceCheckUtils]: 49: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L273 TraceCheckUtils]: 51: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L273 TraceCheckUtils]: 52: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L273 TraceCheckUtils]: 53: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L273 TraceCheckUtils]: 54: Hoare triple {2420#false} havoc ~x~0;~x~0 := 0; {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L273 TraceCheckUtils]: 55: Hoare triple {2420#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2420#false} is VALID [2018-11-23 11:55:31,801 INFO L256 TraceCheckUtils]: 56: Hoare triple {2420#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {2420#false} is VALID [2018-11-23 11:55:31,802 INFO L273 TraceCheckUtils]: 57: Hoare triple {2420#false} ~cond := #in~cond; {2420#false} is VALID [2018-11-23 11:55:31,802 INFO L273 TraceCheckUtils]: 58: Hoare triple {2420#false} assume 0 == ~cond; {2420#false} is VALID [2018-11-23 11:55:31,802 INFO L273 TraceCheckUtils]: 59: Hoare triple {2420#false} assume !false; {2420#false} is VALID [2018-11-23 11:55:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 11:55:31,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:31,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:31,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:45,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:55:45,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:45,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:45,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {2419#true} call ULTIMATE.init(); {2419#true} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 1: Hoare triple {2419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2419#true} is VALID [2018-11-23 11:55:45,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {2419#true} assume true; {2419#true} is VALID [2018-11-23 11:55:45,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2419#true} {2419#true} #126#return; {2419#true} is VALID [2018-11-23 11:55:45,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {2419#true} call #t~ret2 := main(); {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {2419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {2419#true} ~i~0 := 0; {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {2419#true} ~i~0 := 0; {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 11:55:45,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#true} ~i~0 := 0; {2419#true} is VALID [2018-11-23 11:55:45,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 11:55:45,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 11:55:45,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {2419#true} ~i~0 := 0; {2529#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:45,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {2529#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2422#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,320 INFO L273 TraceCheckUtils]: 35: Hoare triple {2422#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2423#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {2423#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2424#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {2424#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2425#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {2425#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2426#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {2426#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:45,323 INFO L273 TraceCheckUtils]: 40: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:45,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,323 INFO L273 TraceCheckUtils]: 44: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,325 INFO L273 TraceCheckUtils]: 52: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 11:55:45,325 INFO L273 TraceCheckUtils]: 53: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 11:55:45,325 INFO L273 TraceCheckUtils]: 54: Hoare triple {2420#false} havoc ~x~0;~x~0 := 0; {2420#false} is VALID [2018-11-23 11:55:45,325 INFO L273 TraceCheckUtils]: 55: Hoare triple {2420#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2420#false} is VALID [2018-11-23 11:55:45,325 INFO L256 TraceCheckUtils]: 56: Hoare triple {2420#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {2420#false} is VALID [2018-11-23 11:55:45,326 INFO L273 TraceCheckUtils]: 57: Hoare triple {2420#false} ~cond := #in~cond; {2420#false} is VALID [2018-11-23 11:55:45,326 INFO L273 TraceCheckUtils]: 58: Hoare triple {2420#false} assume 0 == ~cond; {2420#false} is VALID [2018-11-23 11:55:45,326 INFO L273 TraceCheckUtils]: 59: Hoare triple {2420#false} assume !false; {2420#false} is VALID [2018-11-23 11:55:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 11:55:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:55:45,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 11:55:45,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:45,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:55:45,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:45,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:45,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:45,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:45,407 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2018-11-23 11:55:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,059 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 11:55:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:46,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 11:55:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-23 11:55:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-23 11:55:46,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 115 transitions. [2018-11-23 11:55:46,215 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 11:55:46,217 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:55:46,217 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:55:46,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:55:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 11:55:46,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:46,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:46,303 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:46,303 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,306 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 11:55:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-23 11:55:46,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:46,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:46,307 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:46,307 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,309 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 11:55:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-23 11:55:46,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:46,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:46,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:46,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:55:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-23 11:55:46,312 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 60 [2018-11-23 11:55:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:46,313 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-23 11:55:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-23 11:55:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:55:46,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,314 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:46,314 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash 757831402, now seen corresponding path program 6 times [2018-11-23 11:55:46,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:46,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3099#true} is VALID [2018-11-23 11:55:46,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {3099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3099#true} is VALID [2018-11-23 11:55:46,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2018-11-23 11:55:46,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #126#return; {3099#true} is VALID [2018-11-23 11:55:46,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret2 := main(); {3099#true} is VALID [2018-11-23 11:55:46,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {3099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3101#(= main_~i~0 0)} is VALID [2018-11-23 11:55:46,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {3101#(= 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; {3102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:46,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {3102#(<= 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; {3103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:46,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {3103#(<= 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; {3104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:46,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {3104#(<= 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; {3105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:46,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {3105#(<= 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; {3106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:46,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {3106#(<= 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; {3107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:46,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {3107#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,636 INFO L273 TraceCheckUtils]: 43: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,637 INFO L273 TraceCheckUtils]: 48: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,638 INFO L273 TraceCheckUtils]: 50: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,638 INFO L273 TraceCheckUtils]: 51: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,638 INFO L273 TraceCheckUtils]: 55: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,639 INFO L273 TraceCheckUtils]: 56: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,639 INFO L273 TraceCheckUtils]: 58: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,639 INFO L273 TraceCheckUtils]: 59: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:46,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:46,639 INFO L273 TraceCheckUtils]: 61: Hoare triple {3100#false} havoc ~x~0;~x~0 := 0; {3100#false} is VALID [2018-11-23 11:55:46,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {3100#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3100#false} is VALID [2018-11-23 11:55:46,640 INFO L256 TraceCheckUtils]: 63: Hoare triple {3100#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {3100#false} is VALID [2018-11-23 11:55:46,640 INFO L273 TraceCheckUtils]: 64: Hoare triple {3100#false} ~cond := #in~cond; {3100#false} is VALID [2018-11-23 11:55:46,640 INFO L273 TraceCheckUtils]: 65: Hoare triple {3100#false} assume 0 == ~cond; {3100#false} is VALID [2018-11-23 11:55:46,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2018-11-23 11:55:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 11:55:46,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:46,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:46,657 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:48,292 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:55:48,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:48,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3099#true} is VALID [2018-11-23 11:55:48,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {3099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3099#true} is VALID [2018-11-23 11:55:48,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2018-11-23 11:55:48,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #126#return; {3099#true} is VALID [2018-11-23 11:55:48,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret2 := main(); {3099#true} is VALID [2018-11-23 11:55:48,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {3099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3126#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:48,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {3126#(<= 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; {3102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:48,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {3102#(<= 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; {3103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:48,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {3103#(<= 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; {3104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:48,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {3104#(<= 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; {3105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:48,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {3105#(<= 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; {3106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:48,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {3106#(<= 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; {3107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:48,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {3107#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 37: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 41: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 42: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 51: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 52: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 53: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 54: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 55: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L273 TraceCheckUtils]: 58: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {3100#false} havoc ~x~0;~x~0 := 0; {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L273 TraceCheckUtils]: 62: Hoare triple {3100#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3100#false} is VALID [2018-11-23 11:55:48,560 INFO L256 TraceCheckUtils]: 63: Hoare triple {3100#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {3100#false} is VALID [2018-11-23 11:55:48,561 INFO L273 TraceCheckUtils]: 64: Hoare triple {3100#false} ~cond := #in~cond; {3100#false} is VALID [2018-11-23 11:55:48,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {3100#false} assume 0 == ~cond; {3100#false} is VALID [2018-11-23 11:55:48,561 INFO L273 TraceCheckUtils]: 66: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2018-11-23 11:55:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 11:55:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:55:48,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-11-23 11:55:48,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:48,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:55:48,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:48,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:55:48,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:55:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:48,630 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 10 states. [2018-11-23 11:55:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,171 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-11-23 11:55:49,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:49,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-11-23 11:55:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2018-11-23 11:55:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2018-11-23 11:55:49,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 122 transitions. [2018-11-23 11:55:49,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:49,347 INFO L225 Difference]: With dead ends: 138 [2018-11-23 11:55:49,348 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:55:49,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:55:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 11:55:49,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:49,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-23 11:55:49,399 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 11:55:49,400 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 11:55:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,403 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-23 11:55:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 11:55:49,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:49,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:49,403 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 11:55:49,404 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 11:55:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,406 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-23 11:55:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 11:55:49,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:49,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:49,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:49,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:55:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-23 11:55:49,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 67 [2018-11-23 11:55:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:49,409 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-23 11:55:49,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 11:55:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 11:55:49,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:49,410 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:49,410 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:49,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1686307833, now seen corresponding path program 7 times [2018-11-23 11:55:49,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:49,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:49,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2018-11-23 11:55:49,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {3855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3855#true} is VALID [2018-11-23 11:55:49,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2018-11-23 11:55:49,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #126#return; {3855#true} is VALID [2018-11-23 11:55:49,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret2 := main(); {3855#true} is VALID [2018-11-23 11:55:49,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {3855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3857#(= main_~i~0 0)} is VALID [2018-11-23 11:55:49,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {3857#(= 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; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {3858#(<= 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; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {3859#(<= 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; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {3860#(<= 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; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#(<= 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; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {3862#(<= 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; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {3863#(<= 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; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {3864#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,730 INFO L273 TraceCheckUtils]: 47: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,732 INFO L273 TraceCheckUtils]: 54: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,732 INFO L273 TraceCheckUtils]: 55: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,733 INFO L273 TraceCheckUtils]: 62: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,734 INFO L273 TraceCheckUtils]: 67: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {3856#false} havoc ~x~0;~x~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,734 INFO L273 TraceCheckUtils]: 69: Hoare triple {3856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3856#false} is VALID [2018-11-23 11:55:49,734 INFO L256 TraceCheckUtils]: 70: Hoare triple {3856#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {3856#false} is VALID [2018-11-23 11:55:49,734 INFO L273 TraceCheckUtils]: 71: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2018-11-23 11:55:49,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2018-11-23 11:55:49,735 INFO L273 TraceCheckUtils]: 73: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2018-11-23 11:55:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 11:55:49,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:49,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2018-11-23 11:55:49,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {3855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3855#true} is VALID [2018-11-23 11:55:49,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2018-11-23 11:55:49,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #126#return; {3855#true} is VALID [2018-11-23 11:55:49,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret2 := main(); {3855#true} is VALID [2018-11-23 11:55:49,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {3855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3883#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:49,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {3883#(<= 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; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {3858#(<= 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; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {3859#(<= 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; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {3860#(<= 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; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#(<= 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; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {3862#(<= 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; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {3863#(<= 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; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {3864#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,939 INFO L273 TraceCheckUtils]: 21: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,941 INFO L273 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,942 INFO L273 TraceCheckUtils]: 38: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,942 INFO L273 TraceCheckUtils]: 39: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 40: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 41: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 42: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 49: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 50: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 53: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 55: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 56: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 57: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 58: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 59: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 60: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,945 INFO L273 TraceCheckUtils]: 61: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,946 INFO L273 TraceCheckUtils]: 62: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,946 INFO L273 TraceCheckUtils]: 63: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,946 INFO L273 TraceCheckUtils]: 64: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,946 INFO L273 TraceCheckUtils]: 65: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,946 INFO L273 TraceCheckUtils]: 66: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 11:55:49,947 INFO L273 TraceCheckUtils]: 67: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 11:55:49,947 INFO L273 TraceCheckUtils]: 68: Hoare triple {3856#false} havoc ~x~0;~x~0 := 0; {3856#false} is VALID [2018-11-23 11:55:49,947 INFO L273 TraceCheckUtils]: 69: Hoare triple {3856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3856#false} is VALID [2018-11-23 11:55:49,947 INFO L256 TraceCheckUtils]: 70: Hoare triple {3856#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {3856#false} is VALID [2018-11-23 11:55:49,947 INFO L273 TraceCheckUtils]: 71: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2018-11-23 11:55:49,947 INFO L273 TraceCheckUtils]: 72: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2018-11-23 11:55:49,948 INFO L273 TraceCheckUtils]: 73: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2018-11-23 11:55:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 11:55:49,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:49,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:49,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 11:55:49,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:49,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:50,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:50,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:50,082 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 11 states. [2018-11-23 11:55:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,623 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-11-23 11:55:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:50,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 11:55:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 11:55:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 11:55:50,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2018-11-23 11:55:50,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:50,778 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:55:50,779 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 11:55:50,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 11:55:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 11:55:50,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:50,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 11:55:50,883 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 11:55:50,884 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 11:55:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,887 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-23 11:55:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 11:55:50,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:50,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:50,888 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 11:55:50,888 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 11:55:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,891 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-23 11:55:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 11:55:50,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:50,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:50,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:50,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:55:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-11-23 11:55:50,895 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 74 [2018-11-23 11:55:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,895 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-11-23 11:55:50,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 11:55:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 11:55:50,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,896 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:50,896 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,896 INFO L82 PathProgramCache]: Analyzing trace with hash 494861386, now seen corresponding path program 8 times [2018-11-23 11:55:50,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:50,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:51,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {4687#true} call ULTIMATE.init(); {4687#true} is VALID [2018-11-23 11:55:51,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {4687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4687#true} is VALID [2018-11-23 11:55:51,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {4687#true} assume true; {4687#true} is VALID [2018-11-23 11:55:51,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4687#true} {4687#true} #126#return; {4687#true} is VALID [2018-11-23 11:55:51,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {4687#true} call #t~ret2 := main(); {4687#true} is VALID [2018-11-23 11:55:51,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {4687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4689#(= main_~i~0 0)} is VALID [2018-11-23 11:55:51,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {4689#(= 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; {4690#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:51,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {4690#(<= 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; {4691#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:51,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {4691#(<= 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; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:51,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {4692#(<= 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; {4693#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:51,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= 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; {4694#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:51,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {4694#(<= 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; {4695#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:51,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {4695#(<= 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; {4696#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:51,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {4696#(<= 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; {4697#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:51,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {4697#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 48: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,154 INFO L273 TraceCheckUtils]: 65: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,155 INFO L273 TraceCheckUtils]: 67: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,155 INFO L273 TraceCheckUtils]: 69: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,155 INFO L273 TraceCheckUtils]: 70: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L273 TraceCheckUtils]: 72: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L273 TraceCheckUtils]: 73: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L273 TraceCheckUtils]: 74: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L273 TraceCheckUtils]: 75: Hoare triple {4688#false} havoc ~x~0;~x~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L273 TraceCheckUtils]: 76: Hoare triple {4688#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L256 TraceCheckUtils]: 77: Hoare triple {4688#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {4688#false} is VALID [2018-11-23 11:55:51,156 INFO L273 TraceCheckUtils]: 78: Hoare triple {4688#false} ~cond := #in~cond; {4688#false} is VALID [2018-11-23 11:55:51,157 INFO L273 TraceCheckUtils]: 79: Hoare triple {4688#false} assume 0 == ~cond; {4688#false} is VALID [2018-11-23 11:55:51,157 INFO L273 TraceCheckUtils]: 80: Hoare triple {4688#false} assume !false; {4688#false} is VALID [2018-11-23 11:55:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 11:55:51,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:51,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:51,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:51,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:51,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:51,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:51,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {4687#true} call ULTIMATE.init(); {4687#true} is VALID [2018-11-23 11:55:51,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {4687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4687#true} is VALID [2018-11-23 11:55:51,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {4687#true} assume true; {4687#true} is VALID [2018-11-23 11:55:51,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4687#true} {4687#true} #126#return; {4687#true} is VALID [2018-11-23 11:55:51,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {4687#true} call #t~ret2 := main(); {4687#true} is VALID [2018-11-23 11:55:51,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {4687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4716#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:51,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {4716#(<= 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; {4690#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:51,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {4690#(<= 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; {4691#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:51,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {4691#(<= 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; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:51,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {4692#(<= 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; {4693#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:51,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= 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; {4694#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:51,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {4694#(<= 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; {4695#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:51,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {4695#(<= 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; {4696#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:51,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {4696#(<= 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; {4697#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:51,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {4697#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,478 INFO L273 TraceCheckUtils]: 34: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,479 INFO L273 TraceCheckUtils]: 38: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 54: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,482 INFO L273 TraceCheckUtils]: 60: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,483 INFO L273 TraceCheckUtils]: 61: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,483 INFO L273 TraceCheckUtils]: 63: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,483 INFO L273 TraceCheckUtils]: 64: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,484 INFO L273 TraceCheckUtils]: 66: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,484 INFO L273 TraceCheckUtils]: 69: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,485 INFO L273 TraceCheckUtils]: 71: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,485 INFO L273 TraceCheckUtils]: 72: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,485 INFO L273 TraceCheckUtils]: 73: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 11:55:51,485 INFO L273 TraceCheckUtils]: 74: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 11:55:51,486 INFO L273 TraceCheckUtils]: 75: Hoare triple {4688#false} havoc ~x~0;~x~0 := 0; {4688#false} is VALID [2018-11-23 11:55:51,486 INFO L273 TraceCheckUtils]: 76: Hoare triple {4688#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4688#false} is VALID [2018-11-23 11:55:51,486 INFO L256 TraceCheckUtils]: 77: Hoare triple {4688#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {4688#false} is VALID [2018-11-23 11:55:51,486 INFO L273 TraceCheckUtils]: 78: Hoare triple {4688#false} ~cond := #in~cond; {4688#false} is VALID [2018-11-23 11:55:51,486 INFO L273 TraceCheckUtils]: 79: Hoare triple {4688#false} assume 0 == ~cond; {4688#false} is VALID [2018-11-23 11:55:51,487 INFO L273 TraceCheckUtils]: 80: Hoare triple {4688#false} assume !false; {4688#false} is VALID [2018-11-23 11:55:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 11:55:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:51,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-11-23 11:55:51,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:51,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:51,559 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 11:55:51,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:51,560 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 12 states. [2018-11-23 11:55:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,213 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2018-11-23 11:55:52,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:52,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-11-23 11:55:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 11:55:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 11:55:52,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 136 transitions. [2018-11-23 11:55:52,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:52,382 INFO L225 Difference]: With dead ends: 164 [2018-11-23 11:55:52,382 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 11:55:52,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 11:55:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-23 11:55:52,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:52,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2018-11-23 11:55:52,894 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-23 11:55:52,894 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-23 11:55:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,897 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 11:55:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 11:55:52,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:52,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:52,898 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-23 11:55:52,898 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-23 11:55:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,899 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 11:55:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 11:55:52,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:52,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:52,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:52,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:55:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-11-23 11:55:52,902 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 81 [2018-11-23 11:55:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:52,902 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-23 11:55:52,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 11:55:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:55:52,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:52,903 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:52,903 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:52,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash -938874969, now seen corresponding path program 9 times [2018-11-23 11:55:52,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:52,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:52,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:53,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {5595#true} call ULTIMATE.init(); {5595#true} is VALID [2018-11-23 11:55:53,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {5595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5595#true} is VALID [2018-11-23 11:55:53,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {5595#true} assume true; {5595#true} is VALID [2018-11-23 11:55:53,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5595#true} {5595#true} #126#return; {5595#true} is VALID [2018-11-23 11:55:53,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {5595#true} call #t~ret2 := main(); {5595#true} is VALID [2018-11-23 11:55:53,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {5595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5597#(= main_~i~0 0)} is VALID [2018-11-23 11:55:53,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {5597#(= 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; {5598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:53,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {5598#(<= 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; {5599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:53,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {5599#(<= 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; {5600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:53,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {5600#(<= 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; {5601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:53,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {5601#(<= 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; {5602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:53,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {5602#(<= 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; {5603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:53,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {5603#(<= 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; {5604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:53,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {5604#(<= 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; {5605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:53,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {5605#(<= 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; {5606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:53,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {5606#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,146 INFO L273 TraceCheckUtils]: 26: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,146 INFO L273 TraceCheckUtils]: 27: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,147 INFO L273 TraceCheckUtils]: 31: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 44: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 46: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 48: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,149 INFO L273 TraceCheckUtils]: 49: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 51: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 52: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 53: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 55: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 56: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,150 INFO L273 TraceCheckUtils]: 57: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 58: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 59: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 60: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 61: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 62: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 63: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 64: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,151 INFO L273 TraceCheckUtils]: 66: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 67: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 68: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 69: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 70: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 71: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 72: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 73: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 75: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 76: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 77: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 78: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 79: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 80: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 82: Hoare triple {5596#false} havoc ~x~0;~x~0 := 0; {5596#false} is VALID [2018-11-23 11:55:53,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {5596#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5596#false} is VALID [2018-11-23 11:55:53,154 INFO L256 TraceCheckUtils]: 84: Hoare triple {5596#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {5596#false} is VALID [2018-11-23 11:55:53,154 INFO L273 TraceCheckUtils]: 85: Hoare triple {5596#false} ~cond := #in~cond; {5596#false} is VALID [2018-11-23 11:55:53,154 INFO L273 TraceCheckUtils]: 86: Hoare triple {5596#false} assume 0 == ~cond; {5596#false} is VALID [2018-11-23 11:55:53,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {5596#false} assume !false; {5596#false} is VALID [2018-11-23 11:55:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-23 11:55:53,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:53,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:56:11,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:56:11,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:11,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:11,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {5595#true} call ULTIMATE.init(); {5595#true} is VALID [2018-11-23 11:56:11,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {5595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5595#true} is VALID [2018-11-23 11:56:11,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {5595#true} assume true; {5595#true} is VALID [2018-11-23 11:56:11,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5595#true} {5595#true} #126#return; {5595#true} is VALID [2018-11-23 11:56:11,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {5595#true} call #t~ret2 := main(); {5595#true} is VALID [2018-11-23 11:56:11,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {5595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5595#true} is VALID [2018-11-23 11:56:11,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5652#(<= main_~i~0 100000)} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {5652#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {5595#true} ~i~0 := 0; {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 11:56:11,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5652#(<= main_~i~0 100000)} is VALID [2018-11-23 11:56:11,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {5652#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5595#true} is VALID [2018-11-23 11:56:11,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {5595#true} ~i~0 := 0; {5692#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:11,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {5692#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5598#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:11,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {5598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5599#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:11,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {5599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5600#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:11,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {5600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5601#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:11,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {5601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5602#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:11,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {5602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5603#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:11,235 INFO L273 TraceCheckUtils]: 34: Hoare triple {5603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5604#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:11,235 INFO L273 TraceCheckUtils]: 35: Hoare triple {5604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5605#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:11,236 INFO L273 TraceCheckUtils]: 36: Hoare triple {5605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5606#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:11,237 INFO L273 TraceCheckUtils]: 37: Hoare triple {5606#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:56:11,237 INFO L273 TraceCheckUtils]: 38: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:56:11,237 INFO L273 TraceCheckUtils]: 39: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:56:11,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:56:11,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:56:11,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:56:11,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,242 INFO L273 TraceCheckUtils]: 66: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 67: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 68: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 72: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 73: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,243 INFO L273 TraceCheckUtils]: 74: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 76: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 77: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 78: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 79: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 80: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 81: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 82: Hoare triple {5596#false} havoc ~x~0;~x~0 := 0; {5596#false} is VALID [2018-11-23 11:56:11,244 INFO L273 TraceCheckUtils]: 83: Hoare triple {5596#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5596#false} is VALID [2018-11-23 11:56:11,245 INFO L256 TraceCheckUtils]: 84: Hoare triple {5596#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {5596#false} is VALID [2018-11-23 11:56:11,245 INFO L273 TraceCheckUtils]: 85: Hoare triple {5596#false} ~cond := #in~cond; {5596#false} is VALID [2018-11-23 11:56:11,245 INFO L273 TraceCheckUtils]: 86: Hoare triple {5596#false} assume 0 == ~cond; {5596#false} is VALID [2018-11-23 11:56:11,245 INFO L273 TraceCheckUtils]: 87: Hoare triple {5596#false} assume !false; {5596#false} is VALID [2018-11-23 11:56:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-23 11:56:11,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:11,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-11-23 11:56:11,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-11-23 11:56:11,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:11,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:56:11,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:11,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:56:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:56:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:56:11,326 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 14 states. [2018-11-23 11:56:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:12,244 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2018-11-23 11:56:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:56:12,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-11-23 11:56:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:56:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2018-11-23 11:56:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:56:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2018-11-23 11:56:12,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 143 transitions. [2018-11-23 11:56:12,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:12,407 INFO L225 Difference]: With dead ends: 177 [2018-11-23 11:56:12,407 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 11:56:12,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:56:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 11:56:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 11:56:12,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:12,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:12,880 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:12,881 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:12,883 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-11-23 11:56:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 11:56:12,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:12,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:12,883 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:12,884 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:12,886 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-11-23 11:56:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 11:56:12,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:12,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:12,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:12,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:56:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-11-23 11:56:12,888 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 88 [2018-11-23 11:56:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:12,889 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-11-23 11:56:12,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:56:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 11:56:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:56:12,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:12,890 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:12,890 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:12,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1207453270, now seen corresponding path program 10 times [2018-11-23 11:56:12,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:12,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:13,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {6580#true} call ULTIMATE.init(); {6580#true} is VALID [2018-11-23 11:56:13,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {6580#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6580#true} is VALID [2018-11-23 11:56:13,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {6580#true} assume true; {6580#true} is VALID [2018-11-23 11:56:13,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6580#true} {6580#true} #126#return; {6580#true} is VALID [2018-11-23 11:56:13,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {6580#true} call #t~ret2 := main(); {6580#true} is VALID [2018-11-23 11:56:13,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {6580#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6582#(= main_~i~0 0)} is VALID [2018-11-23 11:56:13,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {6582#(= 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; {6583#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:13,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {6583#(<= 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; {6584#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:13,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {6584#(<= 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; {6585#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:13,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {6585#(<= 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; {6586#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:13,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {6586#(<= 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; {6587#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:13,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {6587#(<= 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; {6588#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:13,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {6588#(<= 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; {6589#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:13,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {6589#(<= 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; {6590#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:13,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {6590#(<= 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; {6591#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:13,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {6591#(<= 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; {6592#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:13,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {6592#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,315 INFO L273 TraceCheckUtils]: 39: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 42: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 45: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 56: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,317 INFO L273 TraceCheckUtils]: 57: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 58: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 59: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 62: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 63: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 64: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,318 INFO L273 TraceCheckUtils]: 65: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 66: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 68: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 70: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 72: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 73: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,319 INFO L273 TraceCheckUtils]: 74: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 78: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 79: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 80: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 81: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,320 INFO L273 TraceCheckUtils]: 82: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 83: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 84: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 85: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 89: Hoare triple {6581#false} havoc ~x~0;~x~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,321 INFO L273 TraceCheckUtils]: 90: Hoare triple {6581#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6581#false} is VALID [2018-11-23 11:56:13,322 INFO L256 TraceCheckUtils]: 91: Hoare triple {6581#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {6581#false} is VALID [2018-11-23 11:56:13,322 INFO L273 TraceCheckUtils]: 92: Hoare triple {6581#false} ~cond := #in~cond; {6581#false} is VALID [2018-11-23 11:56:13,322 INFO L273 TraceCheckUtils]: 93: Hoare triple {6581#false} assume 0 == ~cond; {6581#false} is VALID [2018-11-23 11:56:13,322 INFO L273 TraceCheckUtils]: 94: Hoare triple {6581#false} assume !false; {6581#false} is VALID [2018-11-23 11:56:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:56:13,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:13,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:13,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:13,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:13,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:13,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:13,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {6580#true} call ULTIMATE.init(); {6580#true} is VALID [2018-11-23 11:56:13,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {6580#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6580#true} is VALID [2018-11-23 11:56:13,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {6580#true} assume true; {6580#true} is VALID [2018-11-23 11:56:13,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6580#true} {6580#true} #126#return; {6580#true} is VALID [2018-11-23 11:56:13,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {6580#true} call #t~ret2 := main(); {6580#true} is VALID [2018-11-23 11:56:13,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {6580#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6611#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:13,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {6611#(<= 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; {6583#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:13,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {6583#(<= 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; {6584#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:13,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {6584#(<= 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; {6585#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:13,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {6585#(<= 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; {6586#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:13,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {6586#(<= 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; {6587#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:13,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {6587#(<= 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; {6588#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:13,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {6588#(<= 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; {6589#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:13,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {6589#(<= 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; {6590#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:13,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {6590#(<= 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; {6591#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:13,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {6591#(<= 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; {6592#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:13,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {6592#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,666 INFO L273 TraceCheckUtils]: 18: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 41: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 42: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 44: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 47: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 48: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 49: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 50: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 56: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 57: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 58: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 59: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 63: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 64: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 65: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 66: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 71: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 72: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 73: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 74: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 76: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 77: Hoare triple {6581#false} ~i~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 78: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,674 INFO L273 TraceCheckUtils]: 79: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 80: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 81: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 82: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 83: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 84: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 85: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 86: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,675 INFO L273 TraceCheckUtils]: 87: Hoare triple {6581#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L273 TraceCheckUtils]: 88: Hoare triple {6581#false} assume !(~i~0 < 100000); {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L273 TraceCheckUtils]: 89: Hoare triple {6581#false} havoc ~x~0;~x~0 := 0; {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L273 TraceCheckUtils]: 90: Hoare triple {6581#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L256 TraceCheckUtils]: 91: Hoare triple {6581#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L273 TraceCheckUtils]: 92: Hoare triple {6581#false} ~cond := #in~cond; {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L273 TraceCheckUtils]: 93: Hoare triple {6581#false} assume 0 == ~cond; {6581#false} is VALID [2018-11-23 11:56:13,676 INFO L273 TraceCheckUtils]: 94: Hoare triple {6581#false} assume !false; {6581#false} is VALID [2018-11-23 11:56:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:56:13,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:56:13,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-11-23 11:56:13,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:13,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:56:13,732 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 11:56:13,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:56:13,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:56:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:56:13,733 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 14 states. [2018-11-23 11:56:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:14,385 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2018-11-23 11:56:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:56:14,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-11-23 11:56:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:56:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2018-11-23 11:56:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:56:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2018-11-23 11:56:14,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 150 transitions. [2018-11-23 11:56:14,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:14,949 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:56:14,949 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:56:14,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:56:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:56:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-23 11:56:15,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:15,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 107 states. [2018-11-23 11:56:15,084 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-23 11:56:15,084 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-23 11:56:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:15,087 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-11-23 11:56:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 11:56:15,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:15,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:15,088 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-23 11:56:15,088 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-23 11:56:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:15,090 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-11-23 11:56:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 11:56:15,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:15,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:15,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:15,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 11:56:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-11-23 11:56:15,094 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 95 [2018-11-23 11:56:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:15,094 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-11-23 11:56:15,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:56:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 11:56:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 11:56:15,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:15,096 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:15,096 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:15,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1082522439, now seen corresponding path program 11 times [2018-11-23 11:56:15,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:15,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:15,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:15,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:15,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:16,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {7640#true} call ULTIMATE.init(); {7640#true} is VALID [2018-11-23 11:56:16,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {7640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7640#true} is VALID [2018-11-23 11:56:16,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {7640#true} assume true; {7640#true} is VALID [2018-11-23 11:56:16,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7640#true} {7640#true} #126#return; {7640#true} is VALID [2018-11-23 11:56:16,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {7640#true} call #t~ret2 := main(); {7640#true} is VALID [2018-11-23 11:56:16,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {7640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7642#(= main_~i~0 0)} is VALID [2018-11-23 11:56:16,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {7642#(= 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; {7643#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:16,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {7643#(<= 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; {7644#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:16,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {7644#(<= 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; {7645#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:16,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {7645#(<= 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; {7646#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:16,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {7646#(<= 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; {7647#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:16,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {7647#(<= 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; {7648#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:16,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {7648#(<= 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; {7649#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:16,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {7649#(<= 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; {7650#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:16,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {7650#(<= 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; {7651#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:16,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {7651#(<= 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; {7652#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:16,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {7652#(<= 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; {7653#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:16,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {7653#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,179 INFO L273 TraceCheckUtils]: 28: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,179 INFO L273 TraceCheckUtils]: 29: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,180 INFO L273 TraceCheckUtils]: 30: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,180 INFO L273 TraceCheckUtils]: 35: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,181 INFO L273 TraceCheckUtils]: 37: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,181 INFO L273 TraceCheckUtils]: 38: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,182 INFO L273 TraceCheckUtils]: 43: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,182 INFO L273 TraceCheckUtils]: 44: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,182 INFO L273 TraceCheckUtils]: 45: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,183 INFO L273 TraceCheckUtils]: 53: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,184 INFO L273 TraceCheckUtils]: 54: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,184 INFO L273 TraceCheckUtils]: 55: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,184 INFO L273 TraceCheckUtils]: 56: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,184 INFO L273 TraceCheckUtils]: 57: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,184 INFO L273 TraceCheckUtils]: 58: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,184 INFO L273 TraceCheckUtils]: 59: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,185 INFO L273 TraceCheckUtils]: 60: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,185 INFO L273 TraceCheckUtils]: 61: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,185 INFO L273 TraceCheckUtils]: 62: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,185 INFO L273 TraceCheckUtils]: 63: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,185 INFO L273 TraceCheckUtils]: 64: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,185 INFO L273 TraceCheckUtils]: 65: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,186 INFO L273 TraceCheckUtils]: 66: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,186 INFO L273 TraceCheckUtils]: 67: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,186 INFO L273 TraceCheckUtils]: 68: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,186 INFO L273 TraceCheckUtils]: 69: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,186 INFO L273 TraceCheckUtils]: 70: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,186 INFO L273 TraceCheckUtils]: 71: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,187 INFO L273 TraceCheckUtils]: 72: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,187 INFO L273 TraceCheckUtils]: 73: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,187 INFO L273 TraceCheckUtils]: 74: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,187 INFO L273 TraceCheckUtils]: 75: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,187 INFO L273 TraceCheckUtils]: 76: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,187 INFO L273 TraceCheckUtils]: 77: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,188 INFO L273 TraceCheckUtils]: 78: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,188 INFO L273 TraceCheckUtils]: 79: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,188 INFO L273 TraceCheckUtils]: 80: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,188 INFO L273 TraceCheckUtils]: 81: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,188 INFO L273 TraceCheckUtils]: 82: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,188 INFO L273 TraceCheckUtils]: 83: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,189 INFO L273 TraceCheckUtils]: 84: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,189 INFO L273 TraceCheckUtils]: 85: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,189 INFO L273 TraceCheckUtils]: 86: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,189 INFO L273 TraceCheckUtils]: 87: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,189 INFO L273 TraceCheckUtils]: 88: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,189 INFO L273 TraceCheckUtils]: 89: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,190 INFO L273 TraceCheckUtils]: 90: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,190 INFO L273 TraceCheckUtils]: 91: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,190 INFO L273 TraceCheckUtils]: 92: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,190 INFO L273 TraceCheckUtils]: 93: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,190 INFO L273 TraceCheckUtils]: 94: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:56:16,190 INFO L273 TraceCheckUtils]: 95: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:56:16,191 INFO L273 TraceCheckUtils]: 96: Hoare triple {7641#false} havoc ~x~0;~x~0 := 0; {7641#false} is VALID [2018-11-23 11:56:16,191 INFO L273 TraceCheckUtils]: 97: Hoare triple {7641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7641#false} is VALID [2018-11-23 11:56:16,191 INFO L256 TraceCheckUtils]: 98: Hoare triple {7641#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {7641#false} is VALID [2018-11-23 11:56:16,191 INFO L273 TraceCheckUtils]: 99: Hoare triple {7641#false} ~cond := #in~cond; {7641#false} is VALID [2018-11-23 11:56:16,191 INFO L273 TraceCheckUtils]: 100: Hoare triple {7641#false} assume 0 == ~cond; {7641#false} is VALID [2018-11-23 11:56:16,191 INFO L273 TraceCheckUtils]: 101: Hoare triple {7641#false} assume !false; {7641#false} is VALID [2018-11-23 11:56:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-23 11:56:16,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:16,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:03,602 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:57:03,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:03,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:03,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {7640#true} call ULTIMATE.init(); {7640#true} is VALID [2018-11-23 11:57:03,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {7640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7640#true} is VALID [2018-11-23 11:57:03,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {7640#true} assume true; {7640#true} is VALID [2018-11-23 11:57:03,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7640#true} {7640#true} #126#return; {7640#true} is VALID [2018-11-23 11:57:03,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {7640#true} call #t~ret2 := main(); {7640#true} is VALID [2018-11-23 11:57:03,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {7640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7640#true} is VALID [2018-11-23 11:57:03,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {7640#true} assume !(~i~0 < 100000); {7640#true} is VALID [2018-11-23 11:57:03,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {7640#true} ~i~0 := 0; {7640#true} is VALID [2018-11-23 11:57:03,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {7640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#true} is VALID [2018-11-23 11:57:03,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {7640#true} assume !(~i~0 < 100000); {7640#true} is VALID [2018-11-23 11:57:03,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {7640#true} ~i~0 := 0; {7750#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:03,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {7750#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7643#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:03,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {7643#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7644#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:03,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {7644#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7645#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:03,843 INFO L273 TraceCheckUtils]: 35: Hoare triple {7645#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7646#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:03,844 INFO L273 TraceCheckUtils]: 36: Hoare triple {7646#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7647#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:03,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {7647#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7648#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:03,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {7648#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7649#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:03,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {7649#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7650#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:03,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {7650#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7651#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:03,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {7651#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7652#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:03,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {7652#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7653#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:03,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {7653#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:57:03,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:57:03,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,853 INFO L273 TraceCheckUtils]: 52: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,853 INFO L273 TraceCheckUtils]: 53: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,854 INFO L273 TraceCheckUtils]: 54: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:57:03,854 INFO L273 TraceCheckUtils]: 57: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:57:03,854 INFO L273 TraceCheckUtils]: 58: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,854 INFO L273 TraceCheckUtils]: 59: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 60: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 61: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 62: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 63: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 64: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 65: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,855 INFO L273 TraceCheckUtils]: 66: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,856 INFO L273 TraceCheckUtils]: 67: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,856 INFO L273 TraceCheckUtils]: 68: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,856 INFO L273 TraceCheckUtils]: 69: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:57:03,856 INFO L273 TraceCheckUtils]: 70: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:57:03,856 INFO L273 TraceCheckUtils]: 71: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,856 INFO L273 TraceCheckUtils]: 72: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 73: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 74: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 75: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 76: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 77: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 78: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,857 INFO L273 TraceCheckUtils]: 79: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 80: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 81: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 82: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 83: Hoare triple {7641#false} ~i~0 := 0; {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 84: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 85: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,858 INFO L273 TraceCheckUtils]: 86: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,859 INFO L273 TraceCheckUtils]: 87: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,859 INFO L273 TraceCheckUtils]: 88: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,859 INFO L273 TraceCheckUtils]: 89: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,859 INFO L273 TraceCheckUtils]: 90: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,859 INFO L273 TraceCheckUtils]: 91: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,859 INFO L273 TraceCheckUtils]: 92: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L273 TraceCheckUtils]: 93: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L273 TraceCheckUtils]: 94: Hoare triple {7641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L273 TraceCheckUtils]: 95: Hoare triple {7641#false} assume !(~i~0 < 100000); {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L273 TraceCheckUtils]: 96: Hoare triple {7641#false} havoc ~x~0;~x~0 := 0; {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L273 TraceCheckUtils]: 97: Hoare triple {7641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L256 TraceCheckUtils]: 98: Hoare triple {7641#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {7641#false} is VALID [2018-11-23 11:57:03,860 INFO L273 TraceCheckUtils]: 99: Hoare triple {7641#false} ~cond := #in~cond; {7641#false} is VALID [2018-11-23 11:57:03,861 INFO L273 TraceCheckUtils]: 100: Hoare triple {7641#false} assume 0 == ~cond; {7641#false} is VALID [2018-11-23 11:57:03,861 INFO L273 TraceCheckUtils]: 101: Hoare triple {7641#false} assume !false; {7641#false} is VALID [2018-11-23 11:57:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-23 11:57:03,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:03,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:57:03,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-23 11:57:03,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:03,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:57:03,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:03,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:57:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:57:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:57:03,969 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2018-11-23 11:57:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:04,714 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2018-11-23 11:57:04,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:57:04,714 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-23 11:57:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:57:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-23 11:57:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:57:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-23 11:57:04,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2018-11-23 11:57:05,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:05,399 INFO L225 Difference]: With dead ends: 203 [2018-11-23 11:57:05,399 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:57:05,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:57:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:57:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 11:57:05,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:05,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-23 11:57:05,483 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 11:57:05,483 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 11:57:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:05,486 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 11:57:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 11:57:05,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:05,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:05,487 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 11:57:05,487 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 11:57:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:05,490 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 11:57:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 11:57:05,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:05,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:05,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:05,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:57:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-11-23 11:57:05,493 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 102 [2018-11-23 11:57:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:05,493 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-11-23 11:57:05,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:57:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 11:57:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:57:05,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:05,495 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:05,495 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:05,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:05,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1458319606, now seen corresponding path program 12 times [2018-11-23 11:57:05,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:05,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:05,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:05,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:06,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {8776#true} call ULTIMATE.init(); {8776#true} is VALID [2018-11-23 11:57:06,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {8776#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8776#true} is VALID [2018-11-23 11:57:06,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {8776#true} assume true; {8776#true} is VALID [2018-11-23 11:57:06,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8776#true} {8776#true} #126#return; {8776#true} is VALID [2018-11-23 11:57:06,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {8776#true} call #t~ret2 := main(); {8776#true} is VALID [2018-11-23 11:57:06,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {8776#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8778#(= main_~i~0 0)} is VALID [2018-11-23 11:57:06,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {8778#(= 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; {8779#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:06,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {8779#(<= 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; {8780#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:06,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {8780#(<= 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; {8781#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:06,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {8781#(<= 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; {8782#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:06,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {8782#(<= 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; {8783#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:06,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {8783#(<= 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; {8784#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:06,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {8784#(<= 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; {8785#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:06,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {8785#(<= 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; {8786#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:06,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {8786#(<= 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; {8787#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:06,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {8787#(<= 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; {8788#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:06,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {8788#(<= 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; {8789#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:06,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {8789#(<= 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; {8790#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:06,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {8790#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 30: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 39: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,685 INFO L273 TraceCheckUtils]: 40: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 43: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 44: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 45: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 46: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 47: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,686 INFO L273 TraceCheckUtils]: 48: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 49: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 51: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 52: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 53: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 54: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 55: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,687 INFO L273 TraceCheckUtils]: 57: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 58: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 59: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 60: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 61: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 62: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 63: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,689 INFO L273 TraceCheckUtils]: 65: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,689 INFO L273 TraceCheckUtils]: 66: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,689 INFO L273 TraceCheckUtils]: 67: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,689 INFO L273 TraceCheckUtils]: 68: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,689 INFO L273 TraceCheckUtils]: 69: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,689 INFO L273 TraceCheckUtils]: 70: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,690 INFO L273 TraceCheckUtils]: 71: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,690 INFO L273 TraceCheckUtils]: 72: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,690 INFO L273 TraceCheckUtils]: 73: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,690 INFO L273 TraceCheckUtils]: 74: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,691 INFO L273 TraceCheckUtils]: 77: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,691 INFO L273 TraceCheckUtils]: 79: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,692 INFO L273 TraceCheckUtils]: 83: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,692 INFO L273 TraceCheckUtils]: 84: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,692 INFO L273 TraceCheckUtils]: 85: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,692 INFO L273 TraceCheckUtils]: 86: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,692 INFO L273 TraceCheckUtils]: 87: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,693 INFO L273 TraceCheckUtils]: 88: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,693 INFO L273 TraceCheckUtils]: 89: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,693 INFO L273 TraceCheckUtils]: 90: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,693 INFO L273 TraceCheckUtils]: 91: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,693 INFO L273 TraceCheckUtils]: 92: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,694 INFO L273 TraceCheckUtils]: 93: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,694 INFO L273 TraceCheckUtils]: 94: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,694 INFO L273 TraceCheckUtils]: 95: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,694 INFO L273 TraceCheckUtils]: 97: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,694 INFO L273 TraceCheckUtils]: 98: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,695 INFO L273 TraceCheckUtils]: 99: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,695 INFO L273 TraceCheckUtils]: 100: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,695 INFO L273 TraceCheckUtils]: 101: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:06,695 INFO L273 TraceCheckUtils]: 102: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:06,695 INFO L273 TraceCheckUtils]: 103: Hoare triple {8777#false} havoc ~x~0;~x~0 := 0; {8777#false} is VALID [2018-11-23 11:57:06,695 INFO L273 TraceCheckUtils]: 104: Hoare triple {8777#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8777#false} is VALID [2018-11-23 11:57:06,696 INFO L256 TraceCheckUtils]: 105: Hoare triple {8777#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {8777#false} is VALID [2018-11-23 11:57:06,696 INFO L273 TraceCheckUtils]: 106: Hoare triple {8777#false} ~cond := #in~cond; {8777#false} is VALID [2018-11-23 11:57:06,696 INFO L273 TraceCheckUtils]: 107: Hoare triple {8777#false} assume 0 == ~cond; {8777#false} is VALID [2018-11-23 11:57:06,696 INFO L273 TraceCheckUtils]: 108: Hoare triple {8777#false} assume !false; {8777#false} is VALID [2018-11-23 11:57:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-23 11:57:06,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:06,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:43,927 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:57:43,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:43,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:44,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {8776#true} call ULTIMATE.init(); {8776#true} is VALID [2018-11-23 11:57:44,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {8776#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8776#true} is VALID [2018-11-23 11:57:44,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {8776#true} assume true; {8776#true} is VALID [2018-11-23 11:57:44,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8776#true} {8776#true} #126#return; {8776#true} is VALID [2018-11-23 11:57:44,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {8776#true} call #t~ret2 := main(); {8776#true} is VALID [2018-11-23 11:57:44,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {8776#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8776#true} is VALID [2018-11-23 11:57:44,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {8776#true} assume !(~i~0 < 100000); {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {8776#true} ~i~0 := 0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {8776#true} assume !(~i~0 < 100000); {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {8776#true} ~i~0 := 0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {8776#true} assume !(~i~0 < 100000); {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {8776#true} ~i~0 := 0; {8776#true} is VALID [2018-11-23 11:57:44,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 53: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 55: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 56: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,119 INFO L273 TraceCheckUtils]: 57: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,120 INFO L273 TraceCheckUtils]: 58: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {8776#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#true} is VALID [2018-11-23 11:57:44,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {8776#true} assume !(~i~0 < 100000); {8776#true} is VALID [2018-11-23 11:57:44,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {8776#true} ~i~0 := 0; {8977#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:44,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {8977#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8779#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:44,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {8779#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8780#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:44,122 INFO L273 TraceCheckUtils]: 64: Hoare triple {8780#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8781#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:44,122 INFO L273 TraceCheckUtils]: 65: Hoare triple {8781#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8782#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:44,123 INFO L273 TraceCheckUtils]: 66: Hoare triple {8782#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8783#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:44,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {8783#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8784#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:44,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {8784#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8785#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:44,126 INFO L273 TraceCheckUtils]: 69: Hoare triple {8785#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8786#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:44,127 INFO L273 TraceCheckUtils]: 70: Hoare triple {8786#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8787#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:44,127 INFO L273 TraceCheckUtils]: 71: Hoare triple {8787#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8788#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:44,128 INFO L273 TraceCheckUtils]: 72: Hoare triple {8788#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8789#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:44,139 INFO L273 TraceCheckUtils]: 73: Hoare triple {8789#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8790#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:44,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {8790#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:44,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:44,139 INFO L273 TraceCheckUtils]: 76: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 77: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 78: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 79: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 81: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 82: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 83: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,140 INFO L273 TraceCheckUtils]: 84: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 85: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 86: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 87: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 88: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 89: Hoare triple {8777#false} ~i~0 := 0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 90: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 91: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 92: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,141 INFO L273 TraceCheckUtils]: 93: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 94: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 95: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 96: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 97: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 98: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 99: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 100: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 101: Hoare triple {8777#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8777#false} is VALID [2018-11-23 11:57:44,142 INFO L273 TraceCheckUtils]: 102: Hoare triple {8777#false} assume !(~i~0 < 100000); {8777#false} is VALID [2018-11-23 11:57:44,143 INFO L273 TraceCheckUtils]: 103: Hoare triple {8777#false} havoc ~x~0;~x~0 := 0; {8777#false} is VALID [2018-11-23 11:57:44,143 INFO L273 TraceCheckUtils]: 104: Hoare triple {8777#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8777#false} is VALID [2018-11-23 11:57:44,143 INFO L256 TraceCheckUtils]: 105: Hoare triple {8777#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {8777#false} is VALID [2018-11-23 11:57:44,143 INFO L273 TraceCheckUtils]: 106: Hoare triple {8777#false} ~cond := #in~cond; {8777#false} is VALID [2018-11-23 11:57:44,143 INFO L273 TraceCheckUtils]: 107: Hoare triple {8777#false} assume 0 == ~cond; {8777#false} is VALID [2018-11-23 11:57:44,143 INFO L273 TraceCheckUtils]: 108: Hoare triple {8777#false} assume !false; {8777#false} is VALID [2018-11-23 11:57:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-23 11:57:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:44,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:57:44,177 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-11-23 11:57:44,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:44,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:57:44,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:44,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:57:44,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:57:44,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:57:44,238 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 16 states. [2018-11-23 11:57:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:45,130 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-11-23 11:57:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:57:45,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-11-23 11:57:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:57:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 164 transitions. [2018-11-23 11:57:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:57:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 164 transitions. [2018-11-23 11:57:45,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 164 transitions. [2018-11-23 11:57:45,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:45,700 INFO L225 Difference]: With dead ends: 216 [2018-11-23 11:57:45,700 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:57:45,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:57:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:57:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-23 11:57:45,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:45,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 121 states. [2018-11-23 11:57:45,868 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 121 states. [2018-11-23 11:57:45,868 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 121 states. [2018-11-23 11:57:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:45,870 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-23 11:57:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 11:57:45,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:45,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:45,871 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 121 states. [2018-11-23 11:57:45,871 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 121 states. [2018-11-23 11:57:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:45,874 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-23 11:57:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 11:57:45,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:45,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:45,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:45,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 11:57:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-11-23 11:57:45,877 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 109 [2018-11-23 11:57:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:45,877 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-11-23 11:57:45,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:57:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 11:57:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 11:57:45,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:45,879 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:45,879 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:45,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash -882690329, now seen corresponding path program 13 times [2018-11-23 11:57:45,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:45,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:45,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:45,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:45,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:46,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {9988#true} call ULTIMATE.init(); {9988#true} is VALID [2018-11-23 11:57:46,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {9988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9988#true} is VALID [2018-11-23 11:57:46,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {9988#true} assume true; {9988#true} is VALID [2018-11-23 11:57:46,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9988#true} {9988#true} #126#return; {9988#true} is VALID [2018-11-23 11:57:46,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {9988#true} call #t~ret2 := main(); {9988#true} is VALID [2018-11-23 11:57:46,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {9988#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9990#(= main_~i~0 0)} is VALID [2018-11-23 11:57:46,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {9990#(= 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; {9991#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:46,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {9991#(<= 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; {9992#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:46,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {9992#(<= 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; {9993#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:46,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {9993#(<= 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; {9994#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:46,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {9994#(<= 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; {9995#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:46,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {9995#(<= 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; {9996#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:46,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {9996#(<= 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; {9997#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:46,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {9997#(<= 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; {9998#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:46,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {9998#(<= 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; {9999#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:46,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {9999#(<= 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; {10000#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:46,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {10000#(<= 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; {10001#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:46,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {10001#(<= 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; {10002#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:46,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {10002#(<= 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; {10003#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:46,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {10003#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,760 INFO L273 TraceCheckUtils]: 37: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,762 INFO L273 TraceCheckUtils]: 49: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 56: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 62: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 63: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 64: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 65: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 66: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,764 INFO L273 TraceCheckUtils]: 67: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 68: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 69: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 70: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 71: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 74: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 75: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,765 INFO L273 TraceCheckUtils]: 76: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 77: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 78: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 79: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 80: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 81: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 82: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 83: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 84: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,766 INFO L273 TraceCheckUtils]: 85: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 86: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 87: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 88: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 89: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 90: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 91: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 92: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,767 INFO L273 TraceCheckUtils]: 93: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 94: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 95: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 96: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 97: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 99: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 100: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 101: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,768 INFO L273 TraceCheckUtils]: 102: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 103: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 104: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 105: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 106: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 107: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 108: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 109: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 110: Hoare triple {9989#false} havoc ~x~0;~x~0 := 0; {9989#false} is VALID [2018-11-23 11:57:46,769 INFO L273 TraceCheckUtils]: 111: Hoare triple {9989#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9989#false} is VALID [2018-11-23 11:57:46,770 INFO L256 TraceCheckUtils]: 112: Hoare triple {9989#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {9989#false} is VALID [2018-11-23 11:57:46,770 INFO L273 TraceCheckUtils]: 113: Hoare triple {9989#false} ~cond := #in~cond; {9989#false} is VALID [2018-11-23 11:57:46,770 INFO L273 TraceCheckUtils]: 114: Hoare triple {9989#false} assume 0 == ~cond; {9989#false} is VALID [2018-11-23 11:57:46,770 INFO L273 TraceCheckUtils]: 115: Hoare triple {9989#false} assume !false; {9989#false} is VALID [2018-11-23 11:57:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 11:57:46,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:46,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:46,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:46,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:47,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {9988#true} call ULTIMATE.init(); {9988#true} is VALID [2018-11-23 11:57:47,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {9988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9988#true} is VALID [2018-11-23 11:57:47,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {9988#true} assume true; {9988#true} is VALID [2018-11-23 11:57:47,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9988#true} {9988#true} #126#return; {9988#true} is VALID [2018-11-23 11:57:47,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {9988#true} call #t~ret2 := main(); {9988#true} is VALID [2018-11-23 11:57:47,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {9988#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10022#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:47,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {10022#(<= 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; {9991#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:47,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {9991#(<= 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; {9992#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:47,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {9992#(<= 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; {9993#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:47,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {9993#(<= 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; {9994#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:47,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {9994#(<= 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; {9995#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:47,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {9995#(<= 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; {9996#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:47,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {9996#(<= 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; {9997#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:47,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {9997#(<= 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; {9998#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:47,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {9998#(<= 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; {9999#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:47,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {9999#(<= 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; {10000#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:47,125 INFO L273 TraceCheckUtils]: 16: Hoare triple {10000#(<= 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; {10001#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:47,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {10001#(<= 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; {10002#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:47,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {10002#(<= 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; {10003#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:47,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {10003#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,128 INFO L273 TraceCheckUtils]: 21: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,130 INFO L273 TraceCheckUtils]: 32: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,131 INFO L273 TraceCheckUtils]: 35: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,131 INFO L273 TraceCheckUtils]: 37: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,131 INFO L273 TraceCheckUtils]: 39: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 40: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 41: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 42: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 43: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 44: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 45: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 46: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 47: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,132 INFO L273 TraceCheckUtils]: 48: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 49: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 50: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 51: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 52: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 53: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 54: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 56: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,133 INFO L273 TraceCheckUtils]: 57: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 58: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 59: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 60: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 61: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 62: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 64: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 65: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,134 INFO L273 TraceCheckUtils]: 66: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 67: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 68: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 69: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 70: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 72: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 73: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,135 INFO L273 TraceCheckUtils]: 75: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 76: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 77: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 78: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 79: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 80: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 81: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 82: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 83: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,136 INFO L273 TraceCheckUtils]: 84: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 85: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 86: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 87: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 88: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 89: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 90: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 91: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,137 INFO L273 TraceCheckUtils]: 92: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 93: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 94: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 95: Hoare triple {9989#false} ~i~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 96: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 97: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 98: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 99: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 100: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,138 INFO L273 TraceCheckUtils]: 101: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 102: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 103: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 104: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 105: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 106: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 107: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 108: Hoare triple {9989#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 109: Hoare triple {9989#false} assume !(~i~0 < 100000); {9989#false} is VALID [2018-11-23 11:57:47,139 INFO L273 TraceCheckUtils]: 110: Hoare triple {9989#false} havoc ~x~0;~x~0 := 0; {9989#false} is VALID [2018-11-23 11:57:47,140 INFO L273 TraceCheckUtils]: 111: Hoare triple {9989#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9989#false} is VALID [2018-11-23 11:57:47,140 INFO L256 TraceCheckUtils]: 112: Hoare triple {9989#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {9989#false} is VALID [2018-11-23 11:57:47,140 INFO L273 TraceCheckUtils]: 113: Hoare triple {9989#false} ~cond := #in~cond; {9989#false} is VALID [2018-11-23 11:57:47,140 INFO L273 TraceCheckUtils]: 114: Hoare triple {9989#false} assume 0 == ~cond; {9989#false} is VALID [2018-11-23 11:57:47,140 INFO L273 TraceCheckUtils]: 115: Hoare triple {9989#false} assume !false; {9989#false} is VALID [2018-11-23 11:57:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 11:57:47,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:47,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:57:47,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 116 [2018-11-23 11:57:47,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:47,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:57:47,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:47,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:57:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:57:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:47,201 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 17 states. [2018-11-23 11:57:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:48,167 INFO L93 Difference]: Finished difference Result 229 states and 249 transitions. [2018-11-23 11:57:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:57:48,167 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 116 [2018-11-23 11:57:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 171 transitions. [2018-11-23 11:57:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 171 transitions. [2018-11-23 11:57:48,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 171 transitions. [2018-11-23 11:57:48,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:48,916 INFO L225 Difference]: With dead ends: 229 [2018-11-23 11:57:48,916 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:57:48,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:57:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-23 11:57:49,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:49,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:49,023 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:49,024 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:49,026 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-11-23 11:57:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-23 11:57:49,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:49,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:49,027 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:49,027 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:49,029 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-11-23 11:57:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-23 11:57:49,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:49,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:49,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:49,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 11:57:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-11-23 11:57:49,033 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 116 [2018-11-23 11:57:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:49,033 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-11-23 11:57:49,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:57:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-23 11:57:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 11:57:49,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:49,035 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:49,035 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:49,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash 108084330, now seen corresponding path program 14 times [2018-11-23 11:57:49,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:49,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:49,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {11276#true} call ULTIMATE.init(); {11276#true} is VALID [2018-11-23 11:57:49,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {11276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11276#true} is VALID [2018-11-23 11:57:49,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {11276#true} assume true; {11276#true} is VALID [2018-11-23 11:57:49,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11276#true} {11276#true} #126#return; {11276#true} is VALID [2018-11-23 11:57:49,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {11276#true} call #t~ret2 := main(); {11276#true} is VALID [2018-11-23 11:57:49,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {11276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11278#(= main_~i~0 0)} is VALID [2018-11-23 11:57:49,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {11278#(= 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; {11279#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:49,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {11279#(<= 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; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:49,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {11280#(<= 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; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:49,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {11281#(<= 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; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:49,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {11282#(<= 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; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:49,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {11283#(<= 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; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:49,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {11284#(<= 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; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:49,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {11285#(<= 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; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:49,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {11286#(<= 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; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:49,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {11287#(<= 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; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:49,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {11288#(<= 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; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:49,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {11289#(<= 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; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:49,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {11290#(<= 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; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:49,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {11291#(<= 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; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:49,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {11292#(<= main_~i~0 14)} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 41: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 42: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 47: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 48: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 49: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 50: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 51: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 52: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 54: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 56: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 57: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 58: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 59: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 60: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 61: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 62: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 63: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 65: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 66: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 67: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 68: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 69: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 70: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 71: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 73: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 74: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 75: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 76: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 77: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 78: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 79: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 80: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 82: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 84: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 85: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 86: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 87: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 88: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 89: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,852 INFO L273 TraceCheckUtils]: 90: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 91: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 92: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 93: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 94: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 95: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 96: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 97: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 98: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,853 INFO L273 TraceCheckUtils]: 99: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 100: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 101: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 102: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 103: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 104: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 105: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 106: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 107: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,854 INFO L273 TraceCheckUtils]: 108: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 109: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 110: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 111: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 112: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 113: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 114: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 115: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 116: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:49,855 INFO L273 TraceCheckUtils]: 117: Hoare triple {11277#false} havoc ~x~0;~x~0 := 0; {11277#false} is VALID [2018-11-23 11:57:49,856 INFO L273 TraceCheckUtils]: 118: Hoare triple {11277#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11277#false} is VALID [2018-11-23 11:57:49,856 INFO L256 TraceCheckUtils]: 119: Hoare triple {11277#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {11277#false} is VALID [2018-11-23 11:57:49,856 INFO L273 TraceCheckUtils]: 120: Hoare triple {11277#false} ~cond := #in~cond; {11277#false} is VALID [2018-11-23 11:57:49,856 INFO L273 TraceCheckUtils]: 121: Hoare triple {11277#false} assume 0 == ~cond; {11277#false} is VALID [2018-11-23 11:57:49,856 INFO L273 TraceCheckUtils]: 122: Hoare triple {11277#false} assume !false; {11277#false} is VALID [2018-11-23 11:57:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 11:57:49,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:49,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:57:49,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:57:49,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:49,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:50,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {11276#true} call ULTIMATE.init(); {11276#true} is VALID [2018-11-23 11:57:50,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {11276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11276#true} is VALID [2018-11-23 11:57:50,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {11276#true} assume true; {11276#true} is VALID [2018-11-23 11:57:50,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11276#true} {11276#true} #126#return; {11276#true} is VALID [2018-11-23 11:57:50,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {11276#true} call #t~ret2 := main(); {11276#true} is VALID [2018-11-23 11:57:50,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {11276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11311#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:50,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {11311#(<= 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; {11279#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:50,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {11279#(<= 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; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:50,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {11280#(<= 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; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:50,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {11281#(<= 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; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:50,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {11282#(<= 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; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:50,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {11283#(<= 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; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:50,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {11284#(<= 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; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:50,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {11285#(<= 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; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:50,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {11286#(<= 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; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:50,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {11287#(<= 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; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:50,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {11288#(<= 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; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:50,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {11289#(<= 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; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:50,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {11290#(<= 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; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:50,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {11291#(<= 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; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:50,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {11292#(<= main_~i~0 14)} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,216 INFO L273 TraceCheckUtils]: 37: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,217 INFO L273 TraceCheckUtils]: 40: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,217 INFO L273 TraceCheckUtils]: 41: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 46: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 47: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 49: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 50: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,218 INFO L273 TraceCheckUtils]: 51: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 52: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 53: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 54: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 55: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 56: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 57: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 58: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 59: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,219 INFO L273 TraceCheckUtils]: 60: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 61: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 62: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 63: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 64: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 65: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 66: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 67: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 68: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,220 INFO L273 TraceCheckUtils]: 69: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 70: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 71: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 72: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 73: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 74: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 75: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 76: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 77: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,221 INFO L273 TraceCheckUtils]: 78: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 79: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 80: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 81: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 82: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 83: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 84: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 85: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 86: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,222 INFO L273 TraceCheckUtils]: 87: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 88: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 89: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 90: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 91: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 92: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 93: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 94: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 95: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,223 INFO L273 TraceCheckUtils]: 96: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 97: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 98: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 99: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 100: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 101: Hoare triple {11277#false} ~i~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 102: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 103: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,224 INFO L273 TraceCheckUtils]: 104: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 105: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 106: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 107: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 108: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 109: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 110: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 111: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 112: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,225 INFO L273 TraceCheckUtils]: 113: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 114: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 115: Hoare triple {11277#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 116: Hoare triple {11277#false} assume !(~i~0 < 100000); {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 117: Hoare triple {11277#false} havoc ~x~0;~x~0 := 0; {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 118: Hoare triple {11277#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L256 TraceCheckUtils]: 119: Hoare triple {11277#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 120: Hoare triple {11277#false} ~cond := #in~cond; {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 121: Hoare triple {11277#false} assume 0 == ~cond; {11277#false} is VALID [2018-11-23 11:57:50,226 INFO L273 TraceCheckUtils]: 122: Hoare triple {11277#false} assume !false; {11277#false} is VALID [2018-11-23 11:57:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 11:57:50,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:50,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:57:50,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-11-23 11:57:50,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:50,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:57:50,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:50,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:57:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:57:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:57:50,289 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 18 states. [2018-11-23 11:57:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:51,651 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2018-11-23 11:57:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:57:51,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-11-23 11:57:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:57:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 178 transitions. [2018-11-23 11:57:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:57:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 178 transitions. [2018-11-23 11:57:51,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 178 transitions. [2018-11-23 11:57:52,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:52,442 INFO L225 Difference]: With dead ends: 242 [2018-11-23 11:57:52,442 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 11:57:52,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:57:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 11:57:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-11-23 11:57:52,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:52,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 135 states. [2018-11-23 11:57:52,564 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2018-11-23 11:57:52,564 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2018-11-23 11:57:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:52,568 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-23 11:57:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 11:57:52,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:52,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:52,568 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2018-11-23 11:57:52,568 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2018-11-23 11:57:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:52,570 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-23 11:57:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 11:57:52,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:52,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:52,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:52,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:57:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-11-23 11:57:52,573 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 123 [2018-11-23 11:57:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:52,573 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 11:57:52,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:57:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 11:57:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:57:52,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:52,575 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:52,575 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:52,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1972607623, now seen corresponding path program 15 times [2018-11-23 11:57:52,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:52,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:53,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {12640#true} call ULTIMATE.init(); {12640#true} is VALID [2018-11-23 11:57:53,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {12640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12640#true} is VALID [2018-11-23 11:57:53,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {12640#true} assume true; {12640#true} is VALID [2018-11-23 11:57:53,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12640#true} {12640#true} #126#return; {12640#true} is VALID [2018-11-23 11:57:53,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {12640#true} call #t~ret2 := main(); {12640#true} is VALID [2018-11-23 11:57:53,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {12640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12642#(= main_~i~0 0)} is VALID [2018-11-23 11:57:53,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {12642#(= 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; {12643#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:53,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {12643#(<= 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; {12644#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:53,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {12644#(<= 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; {12645#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:53,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {12645#(<= 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; {12646#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:53,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {12646#(<= 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; {12647#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:53,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {12647#(<= 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; {12648#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:53,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {12648#(<= 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; {12649#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:53,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {12649#(<= 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; {12650#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:53,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {12650#(<= 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; {12651#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:53,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {12651#(<= 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; {12652#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:53,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {12652#(<= 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; {12653#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:53,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {12653#(<= 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; {12654#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:53,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {12654#(<= 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; {12655#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:53,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {12655#(<= 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; {12656#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:53,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {12656#(<= 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; {12657#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:53,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {12657#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,246 INFO L273 TraceCheckUtils]: 30: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,246 INFO L273 TraceCheckUtils]: 31: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,246 INFO L273 TraceCheckUtils]: 32: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,247 INFO L273 TraceCheckUtils]: 33: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,247 INFO L273 TraceCheckUtils]: 34: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,247 INFO L273 TraceCheckUtils]: 35: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 40: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 41: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 44: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,248 INFO L273 TraceCheckUtils]: 45: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 47: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 48: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 49: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 50: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 54: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 55: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 56: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 59: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 60: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 61: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,250 INFO L273 TraceCheckUtils]: 62: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 63: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 64: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 65: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 66: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 67: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 68: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 69: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 70: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,251 INFO L273 TraceCheckUtils]: 71: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 74: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 75: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 76: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 77: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,252 INFO L273 TraceCheckUtils]: 78: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 79: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 80: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 81: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 82: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 83: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 84: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 85: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 86: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,253 INFO L273 TraceCheckUtils]: 87: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 88: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 89: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 90: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 91: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 92: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 93: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 94: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 95: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,254 INFO L273 TraceCheckUtils]: 96: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 97: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 98: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 99: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 100: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 101: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 102: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 103: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 104: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,255 INFO L273 TraceCheckUtils]: 105: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 106: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 107: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 108: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 109: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 110: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 111: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 112: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 113: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,256 INFO L273 TraceCheckUtils]: 114: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 115: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 116: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 117: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 118: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 119: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 120: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 121: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 122: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:57:53,257 INFO L273 TraceCheckUtils]: 123: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:57:53,258 INFO L273 TraceCheckUtils]: 124: Hoare triple {12641#false} havoc ~x~0;~x~0 := 0; {12641#false} is VALID [2018-11-23 11:57:53,258 INFO L273 TraceCheckUtils]: 125: Hoare triple {12641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12641#false} is VALID [2018-11-23 11:57:53,258 INFO L256 TraceCheckUtils]: 126: Hoare triple {12641#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {12641#false} is VALID [2018-11-23 11:57:53,258 INFO L273 TraceCheckUtils]: 127: Hoare triple {12641#false} ~cond := #in~cond; {12641#false} is VALID [2018-11-23 11:57:53,258 INFO L273 TraceCheckUtils]: 128: Hoare triple {12641#false} assume 0 == ~cond; {12641#false} is VALID [2018-11-23 11:57:53,258 INFO L273 TraceCheckUtils]: 129: Hoare triple {12641#false} assume !false; {12641#false} is VALID [2018-11-23 11:57:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-23 11:57:53,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:53,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:49,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:58:49,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:49,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:49,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {12640#true} call ULTIMATE.init(); {12640#true} is VALID [2018-11-23 11:58:49,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {12640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12640#true} is VALID [2018-11-23 11:58:49,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {12640#true} assume true; {12640#true} is VALID [2018-11-23 11:58:49,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12640#true} {12640#true} #126#return; {12640#true} is VALID [2018-11-23 11:58:49,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {12640#true} call #t~ret2 := main(); {12640#true} is VALID [2018-11-23 11:58:49,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {12640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12640#true} is VALID [2018-11-23 11:58:49,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,786 INFO L273 TraceCheckUtils]: 19: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {12640#true} assume !(~i~0 < 100000); {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {12640#true} ~i~0 := 0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,787 INFO L273 TraceCheckUtils]: 28: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 33: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 34: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {12640#true} assume !(~i~0 < 100000); {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 39: Hoare triple {12640#true} ~i~0 := 0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 43: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 44: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 51: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 52: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {12640#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#true} is VALID [2018-11-23 11:58:49,791 INFO L273 TraceCheckUtils]: 55: Hoare triple {12640#true} assume !(~i~0 < 100000); {12640#true} is VALID [2018-11-23 11:58:49,791 INFO L273 TraceCheckUtils]: 56: Hoare triple {12640#true} ~i~0 := 0; {12829#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:49,792 INFO L273 TraceCheckUtils]: 57: Hoare triple {12829#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12643#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:49,792 INFO L273 TraceCheckUtils]: 58: Hoare triple {12643#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12644#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {12644#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12645#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,793 INFO L273 TraceCheckUtils]: 60: Hoare triple {12645#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12646#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {12646#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12647#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:49,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {12647#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12648#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:49,795 INFO L273 TraceCheckUtils]: 63: Hoare triple {12648#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12649#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:49,796 INFO L273 TraceCheckUtils]: 64: Hoare triple {12649#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12650#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:49,797 INFO L273 TraceCheckUtils]: 65: Hoare triple {12650#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12651#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:49,797 INFO L273 TraceCheckUtils]: 66: Hoare triple {12651#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12652#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:49,798 INFO L273 TraceCheckUtils]: 67: Hoare triple {12652#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12653#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:49,799 INFO L273 TraceCheckUtils]: 68: Hoare triple {12653#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12654#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:49,800 INFO L273 TraceCheckUtils]: 69: Hoare triple {12654#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12655#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:49,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {12655#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12656#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:49,802 INFO L273 TraceCheckUtils]: 71: Hoare triple {12656#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12657#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 72: Hoare triple {12657#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 73: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 74: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 75: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 76: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 77: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,807 INFO L273 TraceCheckUtils]: 78: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 79: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 80: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 81: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 82: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 84: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 85: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 88: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 89: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 90: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 91: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 92: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 93: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 94: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,809 INFO L273 TraceCheckUtils]: 96: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 97: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 98: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 99: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 100: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 101: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 102: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 104: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,810 INFO L273 TraceCheckUtils]: 105: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 106: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 107: Hoare triple {12641#false} ~i~0 := 0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 108: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 109: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 110: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 111: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 112: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,811 INFO L273 TraceCheckUtils]: 113: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 114: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 115: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 116: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 117: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 118: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 119: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 120: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 121: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,812 INFO L273 TraceCheckUtils]: 122: Hoare triple {12641#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L273 TraceCheckUtils]: 123: Hoare triple {12641#false} assume !(~i~0 < 100000); {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L273 TraceCheckUtils]: 124: Hoare triple {12641#false} havoc ~x~0;~x~0 := 0; {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L273 TraceCheckUtils]: 125: Hoare triple {12641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L256 TraceCheckUtils]: 126: Hoare triple {12641#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L273 TraceCheckUtils]: 127: Hoare triple {12641#false} ~cond := #in~cond; {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L273 TraceCheckUtils]: 128: Hoare triple {12641#false} assume 0 == ~cond; {12641#false} is VALID [2018-11-23 11:58:49,813 INFO L273 TraceCheckUtils]: 129: Hoare triple {12641#false} assume !false; {12641#false} is VALID [2018-11-23 11:58:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-23 11:58:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:58:49,855 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2018-11-23 11:58:49,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:49,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:58:50,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:50,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:58:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:58:50,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:58:50,106 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 19 states. [2018-11-23 11:58:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:52,010 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2018-11-23 11:58:52,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:58:52,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2018-11-23 11:58:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:58:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 185 transitions. [2018-11-23 11:58:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:58:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 185 transitions. [2018-11-23 11:58:52,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 185 transitions. [2018-11-23 11:58:52,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:52,198 INFO L225 Difference]: With dead ends: 255 [2018-11-23 11:58:52,198 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 11:58:52,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 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 11:58:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 11:58:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-23 11:58:52,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:52,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 142 states. [2018-11-23 11:58:52,294 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 11:58:52,295 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 11:58:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:52,297 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-11-23 11:58:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-23 11:58:52,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:52,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:52,297 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 11:58:52,297 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 11:58:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:52,299 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-11-23 11:58:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-23 11:58:52,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:52,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:52,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:52,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 11:58:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2018-11-23 11:58:52,303 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 130 [2018-11-23 11:58:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:52,303 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2018-11-23 11:58:52,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:58:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-23 11:58:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 11:58:52,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:52,305 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:52,305 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:52,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash 795738570, now seen corresponding path program 16 times [2018-11-23 11:58:52,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:52,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:52,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:52,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:52,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:52,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {14080#true} call ULTIMATE.init(); {14080#true} is VALID [2018-11-23 11:58:52,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {14080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14080#true} is VALID [2018-11-23 11:58:52,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {14080#true} assume true; {14080#true} is VALID [2018-11-23 11:58:52,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14080#true} {14080#true} #126#return; {14080#true} is VALID [2018-11-23 11:58:52,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {14080#true} call #t~ret2 := main(); {14080#true} is VALID [2018-11-23 11:58:52,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {14080#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14082#(= main_~i~0 0)} is VALID [2018-11-23 11:58:52,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {14082#(= 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; {14083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:52,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {14083#(<= 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; {14084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {14084#(<= 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; {14085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {14085#(<= 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; {14086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {14086#(<= 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; {14087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {14087#(<= 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; {14088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {14088#(<= 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; {14089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {14089#(<= 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; {14090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {14090#(<= 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; {14091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {14091#(<= 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; {14092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {14092#(<= 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; {14093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {14093#(<= 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; {14094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {14094#(<= 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; {14095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {14095#(<= 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; {14096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {14096#(<= 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; {14097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {14097#(<= 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; {14098#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {14098#(<= main_~i~0 16)} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,895 INFO L273 TraceCheckUtils]: 33: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,895 INFO L273 TraceCheckUtils]: 34: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 35: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 40: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,896 INFO L273 TraceCheckUtils]: 41: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 42: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 43: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 45: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 46: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 47: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 48: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 49: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,897 INFO L273 TraceCheckUtils]: 50: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 51: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 52: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 53: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 54: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 55: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 56: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 57: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 60: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 61: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 62: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 66: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 67: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,899 INFO L273 TraceCheckUtils]: 68: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 69: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 70: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 73: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 74: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 75: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 77: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 78: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 80: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 81: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 82: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 83: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 84: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,901 INFO L273 TraceCheckUtils]: 85: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 86: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 87: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 88: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 89: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 90: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 91: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 92: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 93: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,902 INFO L273 TraceCheckUtils]: 94: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 95: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 96: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 97: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 98: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 99: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 100: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 101: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 102: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,903 INFO L273 TraceCheckUtils]: 103: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 104: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 105: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 106: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 107: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 108: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 109: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 110: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 111: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,904 INFO L273 TraceCheckUtils]: 112: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 113: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 114: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 115: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 116: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 117: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 118: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 119: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,905 INFO L273 TraceCheckUtils]: 120: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 121: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 122: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 123: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 124: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 125: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 126: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 127: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 128: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,906 INFO L273 TraceCheckUtils]: 129: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L273 TraceCheckUtils]: 130: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L273 TraceCheckUtils]: 131: Hoare triple {14081#false} havoc ~x~0;~x~0 := 0; {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L273 TraceCheckUtils]: 132: Hoare triple {14081#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L256 TraceCheckUtils]: 133: Hoare triple {14081#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L273 TraceCheckUtils]: 134: Hoare triple {14081#false} ~cond := #in~cond; {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L273 TraceCheckUtils]: 135: Hoare triple {14081#false} assume 0 == ~cond; {14081#false} is VALID [2018-11-23 11:58:52,907 INFO L273 TraceCheckUtils]: 136: Hoare triple {14081#false} assume !false; {14081#false} is VALID [2018-11-23 11:58:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-23 11:58:52,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:52,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:53,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:53,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:53,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:53,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {14080#true} call ULTIMATE.init(); {14080#true} is VALID [2018-11-23 11:58:53,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {14080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14080#true} is VALID [2018-11-23 11:58:53,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {14080#true} assume true; {14080#true} is VALID [2018-11-23 11:58:53,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14080#true} {14080#true} #126#return; {14080#true} is VALID [2018-11-23 11:58:53,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {14080#true} call #t~ret2 := main(); {14080#true} is VALID [2018-11-23 11:58:53,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {14080#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14117#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:53,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {14117#(<= 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; {14083#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:53,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {14083#(<= 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; {14084#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {14084#(<= 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; {14085#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {14085#(<= 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; {14086#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {14086#(<= 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; {14087#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {14087#(<= 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; {14088#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {14088#(<= 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; {14089#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {14089#(<= 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; {14090#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {14090#(<= 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; {14091#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {14091#(<= 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; {14092#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {14092#(<= 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; {14093#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {14093#(<= 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; {14094#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {14094#(<= 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; {14095#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {14095#(<= 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; {14096#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {14096#(<= 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; {14097#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {14097#(<= 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; {14098#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {14098#(<= main_~i~0 16)} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 46: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 48: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,243 INFO L273 TraceCheckUtils]: 56: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,244 INFO L273 TraceCheckUtils]: 59: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,244 INFO L273 TraceCheckUtils]: 62: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,245 INFO L273 TraceCheckUtils]: 64: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,245 INFO L273 TraceCheckUtils]: 66: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,245 INFO L273 TraceCheckUtils]: 67: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,245 INFO L273 TraceCheckUtils]: 68: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,246 INFO L273 TraceCheckUtils]: 69: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,246 INFO L273 TraceCheckUtils]: 71: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,246 INFO L273 TraceCheckUtils]: 72: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,246 INFO L273 TraceCheckUtils]: 73: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,246 INFO L273 TraceCheckUtils]: 74: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,247 INFO L273 TraceCheckUtils]: 75: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,247 INFO L273 TraceCheckUtils]: 76: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,247 INFO L273 TraceCheckUtils]: 78: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,247 INFO L273 TraceCheckUtils]: 79: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,247 INFO L273 TraceCheckUtils]: 80: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,248 INFO L273 TraceCheckUtils]: 82: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,248 INFO L273 TraceCheckUtils]: 83: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,248 INFO L273 TraceCheckUtils]: 84: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,248 INFO L273 TraceCheckUtils]: 86: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,249 INFO L273 TraceCheckUtils]: 87: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,249 INFO L273 TraceCheckUtils]: 88: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,249 INFO L273 TraceCheckUtils]: 89: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,249 INFO L273 TraceCheckUtils]: 90: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,249 INFO L273 TraceCheckUtils]: 91: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,249 INFO L273 TraceCheckUtils]: 92: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,250 INFO L273 TraceCheckUtils]: 93: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,250 INFO L273 TraceCheckUtils]: 94: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,250 INFO L273 TraceCheckUtils]: 97: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,250 INFO L273 TraceCheckUtils]: 98: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,251 INFO L273 TraceCheckUtils]: 99: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,251 INFO L273 TraceCheckUtils]: 100: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,251 INFO L273 TraceCheckUtils]: 101: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,251 INFO L273 TraceCheckUtils]: 102: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,251 INFO L273 TraceCheckUtils]: 103: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,251 INFO L273 TraceCheckUtils]: 104: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 105: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 106: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 107: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 108: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 109: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 110: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,252 INFO L273 TraceCheckUtils]: 111: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,253 INFO L273 TraceCheckUtils]: 112: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,253 INFO L273 TraceCheckUtils]: 113: Hoare triple {14081#false} ~i~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,253 INFO L273 TraceCheckUtils]: 114: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,253 INFO L273 TraceCheckUtils]: 115: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,253 INFO L273 TraceCheckUtils]: 116: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,253 INFO L273 TraceCheckUtils]: 117: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,254 INFO L273 TraceCheckUtils]: 118: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,254 INFO L273 TraceCheckUtils]: 119: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,254 INFO L273 TraceCheckUtils]: 120: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,254 INFO L273 TraceCheckUtils]: 121: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,254 INFO L273 TraceCheckUtils]: 122: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,254 INFO L273 TraceCheckUtils]: 123: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,255 INFO L273 TraceCheckUtils]: 124: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,255 INFO L273 TraceCheckUtils]: 125: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,255 INFO L273 TraceCheckUtils]: 126: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,255 INFO L273 TraceCheckUtils]: 127: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,255 INFO L273 TraceCheckUtils]: 128: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,255 INFO L273 TraceCheckUtils]: 129: Hoare triple {14081#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L273 TraceCheckUtils]: 130: Hoare triple {14081#false} assume !(~i~0 < 100000); {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L273 TraceCheckUtils]: 131: Hoare triple {14081#false} havoc ~x~0;~x~0 := 0; {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L273 TraceCheckUtils]: 132: Hoare triple {14081#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L256 TraceCheckUtils]: 133: Hoare triple {14081#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L273 TraceCheckUtils]: 134: Hoare triple {14081#false} ~cond := #in~cond; {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L273 TraceCheckUtils]: 135: Hoare triple {14081#false} assume 0 == ~cond; {14081#false} is VALID [2018-11-23 11:58:53,256 INFO L273 TraceCheckUtils]: 136: Hoare triple {14081#false} assume !false; {14081#false} is VALID [2018-11-23 11:58:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-23 11:58:53,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:53,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:58:53,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-11-23 11:58:53,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:53,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:58:53,339 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 11:58:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:58:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:58:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:53,340 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 20 states. [2018-11-23 11:58:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:54,798 INFO L93 Difference]: Finished difference Result 268 states and 288 transitions. [2018-11-23 11:58:54,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:58:54,798 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-11-23 11:58:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 192 transitions. [2018-11-23 11:58:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 192 transitions. [2018-11-23 11:58:54,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 192 transitions. [2018-11-23 11:58:54,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,999 INFO L225 Difference]: With dead ends: 268 [2018-11-23 11:58:54,999 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:58:55,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:58:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-23 11:58:55,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:55,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 149 states. [2018-11-23 11:58:55,127 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-23 11:58:55,127 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-23 11:58:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,129 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-11-23 11:58:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-11-23 11:58:55,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,130 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-23 11:58:55,130 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-23 11:58:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,132 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-11-23 11:58:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-11-23 11:58:55,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:55,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 11:58:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-11-23 11:58:55,135 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 137 [2018-11-23 11:58:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-11-23 11:58:55,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:58:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-11-23 11:58:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 11:58:55,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:55,137 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:55,137 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:55,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1299634649, now seen corresponding path program 17 times [2018-11-23 11:58:55,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:55,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:55,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:55,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat