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_init9_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:41,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:41,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:41,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:41,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:41,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:41,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:41,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:41,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:41,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:41,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:41,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:41,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:41,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:41,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:41,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:41,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:41,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:41,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:41,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:41,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:41,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:41,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:41,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:41,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:41,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:41,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:41,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:41,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:41,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:41,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:41,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:41,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:41,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:41,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:41,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:41,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:02:41,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:41,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:41,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:41,116 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:41,116 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:41,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:41,117 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:41,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:41,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:41,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:41,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:41,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:41,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:41,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:41,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:41,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:41,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:41,119 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:41,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:41,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:41,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:41,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:41,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:41,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:41,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:41,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:41,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:41,121 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:41,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:41,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:41,122 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:41,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:41,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:41,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:41,204 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:41,205 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:41,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init9_true-unreach-call_ground.i [2018-11-23 12:02:41,276 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f270786c8/c71c77cc585a473fa76ffb790e5d6ee1/FLAG82eb54565 [2018-11-23 12:02:41,762 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:41,764 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init9_true-unreach-call_ground.i [2018-11-23 12:02:41,773 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f270786c8/c71c77cc585a473fa76ffb790e5d6ee1/FLAG82eb54565 [2018-11-23 12:02:42,105 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f270786c8/c71c77cc585a473fa76ffb790e5d6ee1 [2018-11-23 12:02:42,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:42,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:42,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:42,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:42,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:42,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5623b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42, skipping insertion in model container [2018-11-23 12:02:42,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:42,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:42,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:42,460 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:42,495 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:42,523 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:42,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42 WrapperNode [2018-11-23 12:02:42,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:42,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:42,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:42,526 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:42,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:42,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:42,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:42,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:42,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... [2018-11-23 12:02:42,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:42,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:42,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:42,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:42,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:42,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:42,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:43,643 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:43,644 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 12:02:43,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:43 BoogieIcfgContainer [2018-11-23 12:02:43,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:43,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:43,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:43,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:43,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:42" (1/3) ... [2018-11-23 12:02:43,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c77c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:43, skipping insertion in model container [2018-11-23 12:02:43,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:42" (2/3) ... [2018-11-23 12:02:43,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c77c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:43, skipping insertion in model container [2018-11-23 12:02:43,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:43" (3/3) ... [2018-11-23 12:02:43,654 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init9_true-unreach-call_ground.i [2018-11-23 12:02:43,664 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:43,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:43,690 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:43,720 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:43,720 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:43,721 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:43,721 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:43,721 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:43,721 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:43,721 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:43,722 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:43,722 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 12:02:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:02:43,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:43,749 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] [2018-11-23 12:02:43,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:43,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:43,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1872712154, now seen corresponding path program 1 times [2018-11-23 12:02:43,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:43,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-23 12:02:43,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42#true} is VALID [2018-11-23 12:02:43,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-23 12:02:43,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #152#return; {42#true} is VALID [2018-11-23 12:02:43,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret2 := main(); {42#true} is VALID [2018-11-23 12:02:43,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {42#true} is VALID [2018-11-23 12:02:43,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-23 12:02:43,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#false} assume !true; {43#false} is VALID [2018-11-23 12:02:43,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 12:02:43,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {43#false} havoc ~x~0;~x~0 := 0; {43#false} is VALID [2018-11-23 12:02:43,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {43#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43#false} is VALID [2018-11-23 12:02:43,943 INFO L256 TraceCheckUtils]: 25: Hoare triple {43#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {43#false} is VALID [2018-11-23 12:02:43,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2018-11-23 12:02:43,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2018-11-23 12:02:43,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-23 12:02:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:43,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:43,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:43,958 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 12:02:43,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:43,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:44,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:44,144 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 12:02:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,406 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2018-11-23 12:02:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:44,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 12:02:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-23 12:02:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-23 12:02:44,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2018-11-23 12:02:44,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,817 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:02:44,817 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:02:44,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:02:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:02:45,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:45,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:45,065 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:45,065 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,070 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 12:02:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 12:02:45,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,072 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:45,072 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,077 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 12:02:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 12:02:45,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:45,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:02:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-23 12:02:45,085 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 29 [2018-11-23 12:02:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:45,085 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 12:02:45,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 12:02:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:02:45,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:45,087 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] [2018-11-23 12:02:45,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:45,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1932733742, now seen corresponding path program 1 times [2018-11-23 12:02:45,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:45,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:45,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-23 12:02:45,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {262#true} is VALID [2018-11-23 12:02:45,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-23 12:02:45,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #152#return; {262#true} is VALID [2018-11-23 12:02:45,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret2 := main(); {262#true} is VALID [2018-11-23 12:02:45,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {264#(= main_~i~0 0)} is VALID [2018-11-23 12:02:45,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {264#(= main_~i~0 0)} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {263#false} ~i~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {263#false} assume !(~i~0 < 100000); {263#false} is VALID [2018-11-23 12:02:45,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {263#false} havoc ~x~0;~x~0 := 0; {263#false} is VALID [2018-11-23 12:02:45,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {263#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {263#false} is VALID [2018-11-23 12:02:45,231 INFO L256 TraceCheckUtils]: 25: Hoare triple {263#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {263#false} is VALID [2018-11-23 12:02:45,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2018-11-23 12:02:45,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2018-11-23 12:02:45,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-23 12:02:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:45,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:45,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:02:45,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:45,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:45,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:45,341 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 3 states. [2018-11-23 12:02:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,760 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2018-11-23 12:02:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:45,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:02:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-23 12:02:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-23 12:02:45,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-23 12:02:46,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,033 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:02:46,034 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:02:46,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:02:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 12:02:46,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:46,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:46,078 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:46,079 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,082 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 12:02:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:02:46,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,084 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:46,084 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,088 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 12:02:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:02:46,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:46,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:02:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 12:02:46,093 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2018-11-23 12:02:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:46,093 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:02:46,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:02:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:02:46,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:46,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:46,095 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:46,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:46,096 INFO L82 PathProgramCache]: Analyzing trace with hash 97911482, now seen corresponding path program 1 times [2018-11-23 12:02:46,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:46,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:46,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:46,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 12:02:46,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {527#true} is VALID [2018-11-23 12:02:46,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 12:02:46,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #152#return; {527#true} is VALID [2018-11-23 12:02:46,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret2 := main(); {527#true} is VALID [2018-11-23 12:02:46,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {527#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {529#(= main_~i~0 0)} is VALID [2018-11-23 12:02:46,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {529#(= 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; {530#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {530#(<= main_~i~0 1)} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,321 INFO L273 TraceCheckUtils]: 18: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,322 INFO L273 TraceCheckUtils]: 21: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {528#false} havoc ~x~0;~x~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {528#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {528#false} is VALID [2018-11-23 12:02:46,326 INFO L256 TraceCheckUtils]: 34: Hoare triple {528#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {528#false} is VALID [2018-11-23 12:02:46,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {528#false} ~cond := #in~cond; {528#false} is VALID [2018-11-23 12:02:46,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {528#false} assume 0 == ~cond; {528#false} is VALID [2018-11-23 12:02:46,327 INFO L273 TraceCheckUtils]: 37: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 12:02:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:02:46,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:46,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:46,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:46,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 12:02:46,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {527#true} is VALID [2018-11-23 12:02:46,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 12:02:46,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #152#return; {527#true} is VALID [2018-11-23 12:02:46,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret2 := main(); {527#true} is VALID [2018-11-23 12:02:46,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {527#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {549#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:46,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {549#(<= 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; {530#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {530#(<= main_~i~0 1)} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {528#false} ~i~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {528#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {528#false} is VALID [2018-11-23 12:02:46,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {528#false} assume !(~i~0 < 100000); {528#false} is VALID [2018-11-23 12:02:46,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {528#false} havoc ~x~0;~x~0 := 0; {528#false} is VALID [2018-11-23 12:02:46,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {528#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {528#false} is VALID [2018-11-23 12:02:46,731 INFO L256 TraceCheckUtils]: 34: Hoare triple {528#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {528#false} is VALID [2018-11-23 12:02:46,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {528#false} ~cond := #in~cond; {528#false} is VALID [2018-11-23 12:02:46,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {528#false} assume 0 == ~cond; {528#false} is VALID [2018-11-23 12:02:46,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 12:02:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:02:46,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:46,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:46,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 12:02:46,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:46,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:46,870 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 12:02:46,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:46,872 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 5 states. [2018-11-23 12:02:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,388 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2018-11-23 12:02:47,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:47,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 12:02:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2018-11-23 12:02:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2018-11-23 12:02:47,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 105 transitions. [2018-11-23 12:02:47,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:47,596 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:02:47,596 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:02:47,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:02:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:02:47,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:47,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,638 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,638 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,642 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-23 12:02:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:02:47,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,644 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,644 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,647 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-23 12:02:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:02:47,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:47,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:02:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-23 12:02:47,652 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 38 [2018-11-23 12:02:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:47,652 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-23 12:02:47,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:02:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:02:47,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:47,654 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:47,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:47,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1965553710, now seen corresponding path program 2 times [2018-11-23 12:02:47,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:47,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:47,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2018-11-23 12:02:47,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {975#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {975#true} is VALID [2018-11-23 12:02:47,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 12:02:47,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #152#return; {975#true} is VALID [2018-11-23 12:02:47,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret2 := main(); {975#true} is VALID [2018-11-23 12:02:47,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {975#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {977#(= main_~i~0 0)} is VALID [2018-11-23 12:02:47,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {977#(= 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; {978#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:47,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {978#(<= 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; {979#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:47,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {979#(<= main_~i~0 2)} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,858 INFO L273 TraceCheckUtils]: 23: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,859 INFO L273 TraceCheckUtils]: 25: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,861 INFO L273 TraceCheckUtils]: 31: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,861 INFO L273 TraceCheckUtils]: 33: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,862 INFO L273 TraceCheckUtils]: 35: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,862 INFO L273 TraceCheckUtils]: 36: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,863 INFO L273 TraceCheckUtils]: 37: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,863 INFO L273 TraceCheckUtils]: 38: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:47,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:47,864 INFO L273 TraceCheckUtils]: 41: Hoare triple {976#false} havoc ~x~0;~x~0 := 0; {976#false} is VALID [2018-11-23 12:02:47,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {976#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {976#false} is VALID [2018-11-23 12:02:47,865 INFO L256 TraceCheckUtils]: 43: Hoare triple {976#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {976#false} is VALID [2018-11-23 12:02:47,865 INFO L273 TraceCheckUtils]: 44: Hoare triple {976#false} ~cond := #in~cond; {976#false} is VALID [2018-11-23 12:02:47,865 INFO L273 TraceCheckUtils]: 45: Hoare triple {976#false} assume 0 == ~cond; {976#false} is VALID [2018-11-23 12:02:47,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {976#false} assume !false; {976#false} is VALID [2018-11-23 12:02:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:02:47,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:47,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:47,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:47,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:47,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:48,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2018-11-23 12:02:48,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {975#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {975#true} is VALID [2018-11-23 12:02:48,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 12:02:48,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #152#return; {975#true} is VALID [2018-11-23 12:02:48,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret2 := main(); {975#true} is VALID [2018-11-23 12:02:48,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {975#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2018-11-23 12:02:48,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#true} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {975#true} is VALID [2018-11-23 12:02:48,247 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#true} assume !(~i~0 < 100000); {975#true} is VALID [2018-11-23 12:02:48,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#true} ~i~0 := 0; {1082#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:48,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {1082#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {978#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:48,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {978#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {979#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:48,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {979#(<= main_~i~0 2)} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:48,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {976#false} ~i~0 := 0; {976#false} is VALID [2018-11-23 12:02:48,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:48,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {976#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {976#false} is VALID [2018-11-23 12:02:48,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {976#false} assume !(~i~0 < 100000); {976#false} is VALID [2018-11-23 12:02:48,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {976#false} havoc ~x~0;~x~0 := 0; {976#false} is VALID [2018-11-23 12:02:48,265 INFO L273 TraceCheckUtils]: 42: Hoare triple {976#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {976#false} is VALID [2018-11-23 12:02:48,266 INFO L256 TraceCheckUtils]: 43: Hoare triple {976#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {976#false} is VALID [2018-11-23 12:02:48,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {976#false} ~cond := #in~cond; {976#false} is VALID [2018-11-23 12:02:48,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {976#false} assume 0 == ~cond; {976#false} is VALID [2018-11-23 12:02:48,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {976#false} assume !false; {976#false} is VALID [2018-11-23 12:02:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:02:48,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:48,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:48,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:02:48,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:48,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:48,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:48,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:48,377 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 6 states. [2018-11-23 12:02:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,763 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2018-11-23 12:02:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:48,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:02:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:02:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:02:48,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2018-11-23 12:02:48,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:48,998 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:02:48,998 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:02:48,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:02:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:02:49,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:49,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:49,066 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:49,066 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,070 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 12:02:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 12:02:49,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,071 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:49,071 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:02:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,075 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 12:02:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 12:02:49,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:49,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:02:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-23 12:02:49,080 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 47 [2018-11-23 12:02:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:49,080 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-23 12:02:49,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 12:02:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:02:49,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:49,082 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:49,083 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:49,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash 369658042, now seen corresponding path program 3 times [2018-11-23 12:02:49,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:49,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:49,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:49,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:49,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2018-11-23 12:02:49,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1521#true} is VALID [2018-11-23 12:02:49,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-23 12:02:49,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #152#return; {1521#true} is VALID [2018-11-23 12:02:49,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret2 := main(); {1521#true} is VALID [2018-11-23 12:02:49,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {1521#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1523#(= main_~i~0 0)} is VALID [2018-11-23 12:02:49,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#(= 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; {1524#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {1524#(<= 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; {1525#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {1525#(<= 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; {1526#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {1526#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,290 INFO L273 TraceCheckUtils]: 27: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,293 INFO L273 TraceCheckUtils]: 39: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,295 INFO L273 TraceCheckUtils]: 45: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {1522#false} havoc ~x~0;~x~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {1522#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1522#false} is VALID [2018-11-23 12:02:49,297 INFO L256 TraceCheckUtils]: 52: Hoare triple {1522#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {1522#false} is VALID [2018-11-23 12:02:49,297 INFO L273 TraceCheckUtils]: 53: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2018-11-23 12:02:49,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2018-11-23 12:02:49,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2018-11-23 12:02:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 12:02:49,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:49,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:49,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:49,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:49,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:49,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:49,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2018-11-23 12:02:49,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1521#true} is VALID [2018-11-23 12:02:49,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-23 12:02:49,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #152#return; {1521#true} is VALID [2018-11-23 12:02:49,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret2 := main(); {1521#true} is VALID [2018-11-23 12:02:49,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {1521#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1521#true} is VALID [2018-11-23 12:02:49,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {1521#true} assume !(~i~0 < 100000); {1521#true} is VALID [2018-11-23 12:02:49,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {1521#true} ~i~0 := 0; {1521#true} is VALID [2018-11-23 12:02:49,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {1521#true} assume !(~i~0 < 100000); {1521#true} is VALID [2018-11-23 12:02:49,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {1521#true} ~i~0 := 0; {1521#true} is VALID [2018-11-23 12:02:49,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {1521#true} assume !(~i~0 < 100000); {1521#true} is VALID [2018-11-23 12:02:49,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {1521#true} ~i~0 := 0; {1521#true} is VALID [2018-11-23 12:02:49,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {1521#true} assume !(~i~0 < 100000); {1521#true} is VALID [2018-11-23 12:02:49,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {1521#true} ~i~0 := 0; {1521#true} is VALID [2018-11-23 12:02:49,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {1521#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1521#true} is VALID [2018-11-23 12:02:49,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {1521#true} assume !(~i~0 < 100000); {1521#true} is VALID [2018-11-23 12:02:49,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {1521#true} ~i~0 := 0; {1620#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:49,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {1620#(<= 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; {1524#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:49,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {1524#(<= 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; {1525#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:49,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {1525#(<= 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; {1526#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:49,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {1526#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,779 INFO L273 TraceCheckUtils]: 42: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {1522#false} ~i~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {1522#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1522#false} is VALID [2018-11-23 12:02:49,782 INFO L273 TraceCheckUtils]: 49: Hoare triple {1522#false} assume !(~i~0 < 100000); {1522#false} is VALID [2018-11-23 12:02:49,782 INFO L273 TraceCheckUtils]: 50: Hoare triple {1522#false} havoc ~x~0;~x~0 := 0; {1522#false} is VALID [2018-11-23 12:02:49,782 INFO L273 TraceCheckUtils]: 51: Hoare triple {1522#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1522#false} is VALID [2018-11-23 12:02:49,783 INFO L256 TraceCheckUtils]: 52: Hoare triple {1522#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {1522#false} is VALID [2018-11-23 12:02:49,783 INFO L273 TraceCheckUtils]: 53: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2018-11-23 12:02:49,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2018-11-23 12:02:49,783 INFO L273 TraceCheckUtils]: 55: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2018-11-23 12:02:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 12:02:49,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:49,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:49,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-23 12:02:49,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:49,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:49,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:49,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:49,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:49,877 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2018-11-23 12:02:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,477 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2018-11-23 12:02:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:50,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-23 12:02:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2018-11-23 12:02:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2018-11-23 12:02:50,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 123 transitions. [2018-11-23 12:02:50,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:50,755 INFO L225 Difference]: With dead ends: 121 [2018-11-23 12:02:50,755 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:02:50,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:02:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 12:02:50,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:50,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:50,850 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:50,850 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,854 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 12:02:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 12:02:50,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:50,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:50,855 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:50,855 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,858 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 12:02:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 12:02:50,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:50,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:50,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:50,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:02:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-11-23 12:02:50,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 56 [2018-11-23 12:02:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:50,863 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-11-23 12:02:50,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 12:02:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:02:50,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:50,865 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:50,866 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:50,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash 24657106, now seen corresponding path program 4 times [2018-11-23 12:02:50,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:50,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:50,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:51,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {2165#true} call ULTIMATE.init(); {2165#true} is VALID [2018-11-23 12:02:51,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {2165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2165#true} is VALID [2018-11-23 12:02:51,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {2165#true} assume true; {2165#true} is VALID [2018-11-23 12:02:51,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2165#true} {2165#true} #152#return; {2165#true} is VALID [2018-11-23 12:02:51,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {2165#true} call #t~ret2 := main(); {2165#true} is VALID [2018-11-23 12:02:51,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {2165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2167#(= main_~i~0 0)} is VALID [2018-11-23 12:02:51,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {2167#(= 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; {2168#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:51,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {2168#(<= 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; {2169#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:51,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {2169#(<= 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; {2170#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:51,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {2170#(<= 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; {2171#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:51,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {2171#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,090 INFO L273 TraceCheckUtils]: 39: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,090 INFO L273 TraceCheckUtils]: 42: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,092 INFO L273 TraceCheckUtils]: 45: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,092 INFO L273 TraceCheckUtils]: 46: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,093 INFO L273 TraceCheckUtils]: 48: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,093 INFO L273 TraceCheckUtils]: 49: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,093 INFO L273 TraceCheckUtils]: 50: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,094 INFO L273 TraceCheckUtils]: 53: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,094 INFO L273 TraceCheckUtils]: 54: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,095 INFO L273 TraceCheckUtils]: 55: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,095 INFO L273 TraceCheckUtils]: 56: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,095 INFO L273 TraceCheckUtils]: 57: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:51,095 INFO L273 TraceCheckUtils]: 58: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:51,095 INFO L273 TraceCheckUtils]: 59: Hoare triple {2166#false} havoc ~x~0;~x~0 := 0; {2166#false} is VALID [2018-11-23 12:02:51,096 INFO L273 TraceCheckUtils]: 60: Hoare triple {2166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2166#false} is VALID [2018-11-23 12:02:51,096 INFO L256 TraceCheckUtils]: 61: Hoare triple {2166#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {2166#false} is VALID [2018-11-23 12:02:51,096 INFO L273 TraceCheckUtils]: 62: Hoare triple {2166#false} ~cond := #in~cond; {2166#false} is VALID [2018-11-23 12:02:51,096 INFO L273 TraceCheckUtils]: 63: Hoare triple {2166#false} assume 0 == ~cond; {2166#false} is VALID [2018-11-23 12:02:51,097 INFO L273 TraceCheckUtils]: 64: Hoare triple {2166#false} assume !false; {2166#false} is VALID [2018-11-23 12:02:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 12:02:51,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:51,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:51,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:51,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:51,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:51,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:52,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {2165#true} call ULTIMATE.init(); {2165#true} is VALID [2018-11-23 12:02:52,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {2165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2165#true} is VALID [2018-11-23 12:02:52,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {2165#true} assume true; {2165#true} is VALID [2018-11-23 12:02:52,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2165#true} {2165#true} #152#return; {2165#true} is VALID [2018-11-23 12:02:52,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {2165#true} call #t~ret2 := main(); {2165#true} is VALID [2018-11-23 12:02:52,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {2165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2190#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:52,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {2190#(<= 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; {2168#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:52,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {2168#(<= 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; {2169#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:52,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {2169#(<= 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; {2170#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:52,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {2170#(<= 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; {2171#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:52,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {2171#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 30: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 42: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 43: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 44: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 45: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 49: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 50: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 51: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {2166#false} ~i~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,081 INFO L273 TraceCheckUtils]: 54: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,082 INFO L273 TraceCheckUtils]: 56: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,082 INFO L273 TraceCheckUtils]: 57: Hoare triple {2166#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2166#false} is VALID [2018-11-23 12:02:52,082 INFO L273 TraceCheckUtils]: 58: Hoare triple {2166#false} assume !(~i~0 < 100000); {2166#false} is VALID [2018-11-23 12:02:52,082 INFO L273 TraceCheckUtils]: 59: Hoare triple {2166#false} havoc ~x~0;~x~0 := 0; {2166#false} is VALID [2018-11-23 12:02:52,082 INFO L273 TraceCheckUtils]: 60: Hoare triple {2166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2166#false} is VALID [2018-11-23 12:02:52,083 INFO L256 TraceCheckUtils]: 61: Hoare triple {2166#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {2166#false} is VALID [2018-11-23 12:02:52,083 INFO L273 TraceCheckUtils]: 62: Hoare triple {2166#false} ~cond := #in~cond; {2166#false} is VALID [2018-11-23 12:02:52,083 INFO L273 TraceCheckUtils]: 63: Hoare triple {2166#false} assume 0 == ~cond; {2166#false} is VALID [2018-11-23 12:02:52,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {2166#false} assume !false; {2166#false} is VALID [2018-11-23 12:02:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 12:02:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:52,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-23 12:02:52,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:52,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:52,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:52,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:52,182 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 8 states. [2018-11-23 12:02:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,750 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2018-11-23 12:02:52,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:52,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-23 12:02:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2018-11-23 12:02:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2018-11-23 12:02:52,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 132 transitions. [2018-11-23 12:02:52,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:52,946 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:02:52,946 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:02:52,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:02:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 12:02:53,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:53,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-23 12:02:53,074 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 12:02:53,075 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 12:02:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:53,078 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-23 12:02:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-23 12:02:53,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:53,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:53,079 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 12:02:53,079 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 12:02:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:53,082 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-23 12:02:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-23 12:02:53,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:53,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:53,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:53,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:02:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-11-23 12:02:53,085 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 65 [2018-11-23 12:02:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:53,086 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-11-23 12:02:53,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-23 12:02:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:02:53,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:53,087 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:53,087 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:53,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash -217477446, now seen corresponding path program 5 times [2018-11-23 12:02:53,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:53,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:53,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:53,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {2907#true} call ULTIMATE.init(); {2907#true} is VALID [2018-11-23 12:02:53,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {2907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2907#true} is VALID [2018-11-23 12:02:53,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {2907#true} assume true; {2907#true} is VALID [2018-11-23 12:02:53,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2907#true} {2907#true} #152#return; {2907#true} is VALID [2018-11-23 12:02:53,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {2907#true} call #t~ret2 := main(); {2907#true} is VALID [2018-11-23 12:02:53,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {2907#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2909#(= main_~i~0 0)} is VALID [2018-11-23 12:02:53,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {2909#(= 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; {2910#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:53,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {2910#(<= 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; {2911#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:53,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {2911#(<= 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; {2912#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:53,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {2912#(<= 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; {2913#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:53,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {2913#(<= 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; {2914#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:53,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {2914#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,517 INFO L273 TraceCheckUtils]: 38: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,518 INFO L273 TraceCheckUtils]: 45: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,518 INFO L273 TraceCheckUtils]: 46: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,519 INFO L273 TraceCheckUtils]: 48: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,520 INFO L273 TraceCheckUtils]: 54: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,520 INFO L273 TraceCheckUtils]: 56: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 58: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 59: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 60: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 61: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 62: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 64: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 65: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 66: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 67: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 68: Hoare triple {2908#false} havoc ~x~0;~x~0 := 0; {2908#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 69: Hoare triple {2908#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2908#false} is VALID [2018-11-23 12:02:53,523 INFO L256 TraceCheckUtils]: 70: Hoare triple {2908#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {2908#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 71: Hoare triple {2908#false} ~cond := #in~cond; {2908#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {2908#false} assume 0 == ~cond; {2908#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {2908#false} assume !false; {2908#false} is VALID [2018-11-23 12:02:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:02:53,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:53,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:53,542 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:10,868 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:03:10,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:11,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {2907#true} call ULTIMATE.init(); {2907#true} is VALID [2018-11-23 12:03:11,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {2907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2907#true} is VALID [2018-11-23 12:03:11,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {2907#true} assume true; {2907#true} is VALID [2018-11-23 12:03:11,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2907#true} {2907#true} #152#return; {2907#true} is VALID [2018-11-23 12:03:11,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {2907#true} call #t~ret2 := main(); {2907#true} is VALID [2018-11-23 12:03:11,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {2907#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2907#true} is VALID [2018-11-23 12:03:11,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {2907#true} assume !(~i~0 < 100000); {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {2907#true} ~i~0 := 0; {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {2907#true} assume !(~i~0 < 100000); {2907#true} is VALID [2018-11-23 12:03:11,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {2907#true} ~i~0 := 0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {2907#true} assume !(~i~0 < 100000); {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {2907#true} ~i~0 := 0; {2907#true} is VALID [2018-11-23 12:03:11,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {2907#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2907#true} is VALID [2018-11-23 12:03:11,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {2907#true} assume !(~i~0 < 100000); {2907#true} is VALID [2018-11-23 12:03:11,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {2907#true} ~i~0 := 0; {3017#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:11,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {3017#(<= 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; {2910#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:11,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {2910#(<= 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; {2911#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:11,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {2911#(<= 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; {2912#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:11,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {2912#(<= 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; {2913#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:11,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {2913#(<= 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; {2914#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:11,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {2914#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:03:11,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:03:11,101 INFO L273 TraceCheckUtils]: 41: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:03:11,102 INFO L273 TraceCheckUtils]: 47: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:03:11,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,103 INFO L273 TraceCheckUtils]: 51: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,103 INFO L273 TraceCheckUtils]: 52: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 58: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 59: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,104 INFO L273 TraceCheckUtils]: 60: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:03:11,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {2908#false} ~i~0 := 0; {2908#false} is VALID [2018-11-23 12:03:11,105 INFO L273 TraceCheckUtils]: 62: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,105 INFO L273 TraceCheckUtils]: 63: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,105 INFO L273 TraceCheckUtils]: 66: Hoare triple {2908#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2908#false} is VALID [2018-11-23 12:03:11,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {2908#false} assume !(~i~0 < 100000); {2908#false} is VALID [2018-11-23 12:03:11,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {2908#false} havoc ~x~0;~x~0 := 0; {2908#false} is VALID [2018-11-23 12:03:11,106 INFO L273 TraceCheckUtils]: 69: Hoare triple {2908#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2908#false} is VALID [2018-11-23 12:03:11,106 INFO L256 TraceCheckUtils]: 70: Hoare triple {2908#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {2908#false} is VALID [2018-11-23 12:03:11,106 INFO L273 TraceCheckUtils]: 71: Hoare triple {2908#false} ~cond := #in~cond; {2908#false} is VALID [2018-11-23 12:03:11,107 INFO L273 TraceCheckUtils]: 72: Hoare triple {2908#false} assume 0 == ~cond; {2908#false} is VALID [2018-11-23 12:03:11,107 INFO L273 TraceCheckUtils]: 73: Hoare triple {2908#false} assume !false; {2908#false} is VALID [2018-11-23 12:03:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:03:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:03:11,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-11-23 12:03:11,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:11,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:03:11,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:11,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:03:11,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:03:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:03:11,190 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 9 states. [2018-11-23 12:03:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,898 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-11-23 12:03:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:03:11,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-11-23 12:03:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:03:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2018-11-23 12:03:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:03:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2018-11-23 12:03:11,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 141 transitions. [2018-11-23 12:03:12,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:12,077 INFO L225 Difference]: With dead ends: 155 [2018-11-23 12:03:12,077 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:03:12,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:03:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:03:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 12:03:12,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:12,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:12,142 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:12,142 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,145 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-11-23 12:03:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-23 12:03:12,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,145 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:12,145 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,148 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-11-23 12:03:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-23 12:03:12,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:12,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:03:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-23 12:03:12,151 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 74 [2018-11-23 12:03:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:12,151 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-23 12:03:12,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:03:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-23 12:03:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:03:12,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:12,152 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:12,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 346386898, now seen corresponding path program 6 times [2018-11-23 12:03:12,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:12,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {3747#true} call ULTIMATE.init(); {3747#true} is VALID [2018-11-23 12:03:12,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {3747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3747#true} is VALID [2018-11-23 12:03:12,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {3747#true} assume true; {3747#true} is VALID [2018-11-23 12:03:12,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3747#true} {3747#true} #152#return; {3747#true} is VALID [2018-11-23 12:03:12,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {3747#true} call #t~ret2 := main(); {3747#true} is VALID [2018-11-23 12:03:12,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {3747#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3749#(= main_~i~0 0)} is VALID [2018-11-23 12:03:12,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {3749#(= 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; {3750#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:12,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {3750#(<= 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; {3751#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:12,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {3751#(<= 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; {3752#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:12,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {3752#(<= 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; {3753#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:12,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {3753#(<= 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; {3754#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:12,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {3754#(<= 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; {3755#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:12,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {3755#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,430 INFO L273 TraceCheckUtils]: 18: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 33: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 34: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 38: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 39: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 40: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 42: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,434 INFO L273 TraceCheckUtils]: 43: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 44: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 45: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 46: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 47: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 48: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,435 INFO L273 TraceCheckUtils]: 50: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,436 INFO L273 TraceCheckUtils]: 51: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,436 INFO L273 TraceCheckUtils]: 52: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,437 INFO L273 TraceCheckUtils]: 57: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,437 INFO L273 TraceCheckUtils]: 58: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,437 INFO L273 TraceCheckUtils]: 59: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,437 INFO L273 TraceCheckUtils]: 60: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,438 INFO L273 TraceCheckUtils]: 61: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,438 INFO L273 TraceCheckUtils]: 62: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,438 INFO L273 TraceCheckUtils]: 63: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,438 INFO L273 TraceCheckUtils]: 64: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,438 INFO L273 TraceCheckUtils]: 65: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,438 INFO L273 TraceCheckUtils]: 66: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,439 INFO L273 TraceCheckUtils]: 67: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,439 INFO L273 TraceCheckUtils]: 68: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,439 INFO L273 TraceCheckUtils]: 69: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,439 INFO L273 TraceCheckUtils]: 70: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,439 INFO L273 TraceCheckUtils]: 71: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,440 INFO L273 TraceCheckUtils]: 73: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,440 INFO L273 TraceCheckUtils]: 74: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,440 INFO L273 TraceCheckUtils]: 75: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:12,440 INFO L273 TraceCheckUtils]: 76: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:12,440 INFO L273 TraceCheckUtils]: 77: Hoare triple {3748#false} havoc ~x~0;~x~0 := 0; {3748#false} is VALID [2018-11-23 12:03:12,441 INFO L273 TraceCheckUtils]: 78: Hoare triple {3748#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3748#false} is VALID [2018-11-23 12:03:12,441 INFO L256 TraceCheckUtils]: 79: Hoare triple {3748#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {3748#false} is VALID [2018-11-23 12:03:12,441 INFO L273 TraceCheckUtils]: 80: Hoare triple {3748#false} ~cond := #in~cond; {3748#false} is VALID [2018-11-23 12:03:12,441 INFO L273 TraceCheckUtils]: 81: Hoare triple {3748#false} assume 0 == ~cond; {3748#false} is VALID [2018-11-23 12:03:12,441 INFO L273 TraceCheckUtils]: 82: Hoare triple {3748#false} assume !false; {3748#false} is VALID [2018-11-23 12:03:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 12:03:12,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:12,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:12,460 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:14,111 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:03:14,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:14,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:14,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {3747#true} call ULTIMATE.init(); {3747#true} is VALID [2018-11-23 12:03:14,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {3747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3747#true} is VALID [2018-11-23 12:03:14,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {3747#true} assume true; {3747#true} is VALID [2018-11-23 12:03:14,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3747#true} {3747#true} #152#return; {3747#true} is VALID [2018-11-23 12:03:14,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {3747#true} call #t~ret2 := main(); {3747#true} is VALID [2018-11-23 12:03:14,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {3747#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3774#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:14,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {3774#(<= 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; {3750#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:14,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {3750#(<= 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; {3751#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:14,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {3751#(<= 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; {3752#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:14,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {3752#(<= 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; {3753#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:14,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {3753#(<= 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; {3754#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:14,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {3754#(<= 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; {3755#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:14,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {3755#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,259 INFO L273 TraceCheckUtils]: 44: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,259 INFO L273 TraceCheckUtils]: 48: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,261 INFO L273 TraceCheckUtils]: 57: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,261 INFO L273 TraceCheckUtils]: 60: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 66: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,263 INFO L273 TraceCheckUtils]: 68: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {3748#false} ~i~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L273 TraceCheckUtils]: 75: Hoare triple {3748#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L273 TraceCheckUtils]: 76: Hoare triple {3748#false} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L273 TraceCheckUtils]: 77: Hoare triple {3748#false} havoc ~x~0;~x~0 := 0; {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {3748#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L256 TraceCheckUtils]: 79: Hoare triple {3748#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {3748#false} is VALID [2018-11-23 12:03:14,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {3748#false} ~cond := #in~cond; {3748#false} is VALID [2018-11-23 12:03:14,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {3748#false} assume 0 == ~cond; {3748#false} is VALID [2018-11-23 12:03:14,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {3748#false} assume !false; {3748#false} is VALID [2018-11-23 12:03:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 12:03:14,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:14,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:03:14,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-11-23 12:03:14,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:14,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:03:14,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:14,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:03:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:03:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:03:14,337 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 10 states. [2018-11-23 12:03:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,000 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2018-11-23 12:03:15,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:03:15,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-11-23 12:03:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:03:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2018-11-23 12:03:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:03:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2018-11-23 12:03:15,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 150 transitions. [2018-11-23 12:03:15,184 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 12:03:15,186 INFO L225 Difference]: With dead ends: 172 [2018-11-23 12:03:15,186 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:03:15,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 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 12:03:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:03:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-23 12:03:15,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:15,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2018-11-23 12:03:15,297 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2018-11-23 12:03:15,298 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2018-11-23 12:03:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,301 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-11-23 12:03:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-11-23 12:03:15,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,302 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2018-11-23 12:03:15,302 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2018-11-23 12:03:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,305 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-11-23 12:03:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-11-23 12:03:15,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:15,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:03:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-11-23 12:03:15,309 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 83 [2018-11-23 12:03:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:15,310 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-11-23 12:03:15,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:03:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-11-23 12:03:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:03:15,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:15,311 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:15,311 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:15,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash -698280774, now seen corresponding path program 7 times [2018-11-23 12:03:15,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:15,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {4685#true} call ULTIMATE.init(); {4685#true} is VALID [2018-11-23 12:03:15,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {4685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4685#true} is VALID [2018-11-23 12:03:15,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {4685#true} assume true; {4685#true} is VALID [2018-11-23 12:03:15,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4685#true} {4685#true} #152#return; {4685#true} is VALID [2018-11-23 12:03:15,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {4685#true} call #t~ret2 := main(); {4685#true} is VALID [2018-11-23 12:03:15,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {4685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4687#(= main_~i~0 0)} is VALID [2018-11-23 12:03:15,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {4687#(= 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; {4688#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:15,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {4688#(<= 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; {4689#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:15,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {4689#(<= 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; {4690#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:15,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {4690#(<= 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; {4691#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:15,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {4691#(<= 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; {4692#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:15,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {4692#(<= 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; {4693#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:15,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {4693#(<= 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; {4694#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:15,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,632 INFO L273 TraceCheckUtils]: 34: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,633 INFO L273 TraceCheckUtils]: 39: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,633 INFO L273 TraceCheckUtils]: 40: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,634 INFO L273 TraceCheckUtils]: 42: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,634 INFO L273 TraceCheckUtils]: 43: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,634 INFO L273 TraceCheckUtils]: 44: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,635 INFO L273 TraceCheckUtils]: 46: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,635 INFO L273 TraceCheckUtils]: 48: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,635 INFO L273 TraceCheckUtils]: 49: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,635 INFO L273 TraceCheckUtils]: 50: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,636 INFO L273 TraceCheckUtils]: 52: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,636 INFO L273 TraceCheckUtils]: 53: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,637 INFO L273 TraceCheckUtils]: 56: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,637 INFO L273 TraceCheckUtils]: 58: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,637 INFO L273 TraceCheckUtils]: 59: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,638 INFO L273 TraceCheckUtils]: 60: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,638 INFO L273 TraceCheckUtils]: 61: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,638 INFO L273 TraceCheckUtils]: 62: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,638 INFO L273 TraceCheckUtils]: 63: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,638 INFO L273 TraceCheckUtils]: 64: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,639 INFO L273 TraceCheckUtils]: 66: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,639 INFO L273 TraceCheckUtils]: 67: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,639 INFO L273 TraceCheckUtils]: 69: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,640 INFO L273 TraceCheckUtils]: 70: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,640 INFO L273 TraceCheckUtils]: 71: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,640 INFO L273 TraceCheckUtils]: 73: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,641 INFO L273 TraceCheckUtils]: 75: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,642 INFO L273 TraceCheckUtils]: 79: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,642 INFO L273 TraceCheckUtils]: 80: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,642 INFO L273 TraceCheckUtils]: 81: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,642 INFO L273 TraceCheckUtils]: 82: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,642 INFO L273 TraceCheckUtils]: 83: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,643 INFO L273 TraceCheckUtils]: 84: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,643 INFO L273 TraceCheckUtils]: 85: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,643 INFO L273 TraceCheckUtils]: 86: Hoare triple {4686#false} havoc ~x~0;~x~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,643 INFO L273 TraceCheckUtils]: 87: Hoare triple {4686#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4686#false} is VALID [2018-11-23 12:03:15,643 INFO L256 TraceCheckUtils]: 88: Hoare triple {4686#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {4686#false} is VALID [2018-11-23 12:03:15,644 INFO L273 TraceCheckUtils]: 89: Hoare triple {4686#false} ~cond := #in~cond; {4686#false} is VALID [2018-11-23 12:03:15,644 INFO L273 TraceCheckUtils]: 90: Hoare triple {4686#false} assume 0 == ~cond; {4686#false} is VALID [2018-11-23 12:03:15,644 INFO L273 TraceCheckUtils]: 91: Hoare triple {4686#false} assume !false; {4686#false} is VALID [2018-11-23 12:03:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-23 12:03:15,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:15,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:15,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:15,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {4685#true} call ULTIMATE.init(); {4685#true} is VALID [2018-11-23 12:03:15,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {4685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4685#true} is VALID [2018-11-23 12:03:15,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {4685#true} assume true; {4685#true} is VALID [2018-11-23 12:03:15,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4685#true} {4685#true} #152#return; {4685#true} is VALID [2018-11-23 12:03:15,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {4685#true} call #t~ret2 := main(); {4685#true} is VALID [2018-11-23 12:03:15,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {4685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4713#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:15,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {4713#(<= 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; {4688#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:15,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {4688#(<= 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; {4689#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:15,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {4689#(<= 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; {4690#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:15,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {4690#(<= 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; {4691#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:15,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {4691#(<= 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; {4692#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:15,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {4692#(<= 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; {4693#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:15,917 INFO L273 TraceCheckUtils]: 12: Hoare triple {4693#(<= 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; {4694#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:15,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,922 INFO L273 TraceCheckUtils]: 29: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,925 INFO L273 TraceCheckUtils]: 48: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,925 INFO L273 TraceCheckUtils]: 49: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 54: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 55: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 56: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 57: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,927 INFO L273 TraceCheckUtils]: 59: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,927 INFO L273 TraceCheckUtils]: 60: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,927 INFO L273 TraceCheckUtils]: 61: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,927 INFO L273 TraceCheckUtils]: 62: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,927 INFO L273 TraceCheckUtils]: 63: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,927 INFO L273 TraceCheckUtils]: 64: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,928 INFO L273 TraceCheckUtils]: 65: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,928 INFO L273 TraceCheckUtils]: 66: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,928 INFO L273 TraceCheckUtils]: 67: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,928 INFO L273 TraceCheckUtils]: 68: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,928 INFO L273 TraceCheckUtils]: 69: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,928 INFO L273 TraceCheckUtils]: 70: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,929 INFO L273 TraceCheckUtils]: 71: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,929 INFO L273 TraceCheckUtils]: 72: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,929 INFO L273 TraceCheckUtils]: 73: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,929 INFO L273 TraceCheckUtils]: 74: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,929 INFO L273 TraceCheckUtils]: 75: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,930 INFO L273 TraceCheckUtils]: 76: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,930 INFO L273 TraceCheckUtils]: 77: Hoare triple {4686#false} ~i~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,930 INFO L273 TraceCheckUtils]: 79: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {4686#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#false} is VALID [2018-11-23 12:03:15,932 INFO L273 TraceCheckUtils]: 85: Hoare triple {4686#false} assume !(~i~0 < 100000); {4686#false} is VALID [2018-11-23 12:03:15,932 INFO L273 TraceCheckUtils]: 86: Hoare triple {4686#false} havoc ~x~0;~x~0 := 0; {4686#false} is VALID [2018-11-23 12:03:15,932 INFO L273 TraceCheckUtils]: 87: Hoare triple {4686#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4686#false} is VALID [2018-11-23 12:03:15,932 INFO L256 TraceCheckUtils]: 88: Hoare triple {4686#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {4686#false} is VALID [2018-11-23 12:03:15,932 INFO L273 TraceCheckUtils]: 89: Hoare triple {4686#false} ~cond := #in~cond; {4686#false} is VALID [2018-11-23 12:03:15,933 INFO L273 TraceCheckUtils]: 90: Hoare triple {4686#false} assume 0 == ~cond; {4686#false} is VALID [2018-11-23 12:03:15,933 INFO L273 TraceCheckUtils]: 91: Hoare triple {4686#false} assume !false; {4686#false} is VALID [2018-11-23 12:03:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-23 12:03:15,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:15,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:03:15,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2018-11-23 12:03:15,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:15,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:03:16,018 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 12:03:16,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:03:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:03:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:03:16,020 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 11 states. [2018-11-23 12:03:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,747 INFO L93 Difference]: Finished difference Result 189 states and 215 transitions. [2018-11-23 12:03:16,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:03:16,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2018-11-23 12:03:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:03:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2018-11-23 12:03:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:03:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2018-11-23 12:03:16,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 159 transitions. [2018-11-23 12:03:16,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:16,920 INFO L225 Difference]: With dead ends: 189 [2018-11-23 12:03:16,920 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:03:16,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:03:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:03:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 12:03:16,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:16,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 12:03:16,986 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 12:03:16,986 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 12:03:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,989 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-11-23 12:03:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-11-23 12:03:16,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:16,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:16,990 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 12:03:16,990 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 12:03:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,994 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-11-23 12:03:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-11-23 12:03:16,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:16,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:16,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:16,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:03:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-11-23 12:03:16,998 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 92 [2018-11-23 12:03:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:16,998 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-11-23 12:03:16,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:03:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-11-23 12:03:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:03:17,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:17,000 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:17,000 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:17,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -732453166, now seen corresponding path program 8 times [2018-11-23 12:03:17,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:17,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {5721#true} call ULTIMATE.init(); {5721#true} is VALID [2018-11-23 12:03:18,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {5721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5721#true} is VALID [2018-11-23 12:03:18,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {5721#true} assume true; {5721#true} is VALID [2018-11-23 12:03:18,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5721#true} {5721#true} #152#return; {5721#true} is VALID [2018-11-23 12:03:18,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {5721#true} call #t~ret2 := main(); {5721#true} is VALID [2018-11-23 12:03:18,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {5721#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5723#(= main_~i~0 0)} is VALID [2018-11-23 12:03:18,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {5723#(= 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; {5724#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {5724#(<= 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; {5725#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {5725#(<= 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; {5726#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {5726#(<= 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; {5727#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {5727#(<= 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; {5728#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {5728#(<= 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; {5729#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {5729#(<= 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; {5730#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {5730#(<= 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; {5731#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {5731#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 42: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 43: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 52: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 53: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 55: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 56: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 57: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 63: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 64: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 65: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 66: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 67: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 70: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 71: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 73: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 74: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 75: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 76: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 77: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 78: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 79: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 80: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 81: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 82: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 83: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 84: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 85: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 86: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 87: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 88: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 89: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 90: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 91: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 92: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 93: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 94: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 95: Hoare triple {5722#false} havoc ~x~0;~x~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 96: Hoare triple {5722#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L256 TraceCheckUtils]: 97: Hoare triple {5722#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 98: Hoare triple {5722#false} ~cond := #in~cond; {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 99: Hoare triple {5722#false} assume 0 == ~cond; {5722#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 100: Hoare triple {5722#false} assume !false; {5722#false} is VALID [2018-11-23 12:03:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:03:18,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:18,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:18,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:18,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:18,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:18,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {5721#true} call ULTIMATE.init(); {5721#true} is VALID [2018-11-23 12:03:18,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {5721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5721#true} is VALID [2018-11-23 12:03:18,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {5721#true} assume true; {5721#true} is VALID [2018-11-23 12:03:18,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5721#true} {5721#true} #152#return; {5721#true} is VALID [2018-11-23 12:03:18,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {5721#true} call #t~ret2 := main(); {5721#true} is VALID [2018-11-23 12:03:18,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {5721#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5750#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:18,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {5750#(<= 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; {5724#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {5724#(<= 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; {5725#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {5725#(<= 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; {5726#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {5726#(<= 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; {5727#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {5727#(<= 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; {5728#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {5728#(<= 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; {5729#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {5729#(<= 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; {5730#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {5730#(<= 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; {5731#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {5731#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 48: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 49: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 50: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 51: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,370 INFO L273 TraceCheckUtils]: 54: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 56: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 57: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 58: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 59: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 65: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 66: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 67: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 68: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 69: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 70: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 71: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,372 INFO L273 TraceCheckUtils]: 72: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 73: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 74: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 75: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 76: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 77: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 78: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 79: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,373 INFO L273 TraceCheckUtils]: 81: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 83: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 84: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 85: Hoare triple {5722#false} ~i~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 86: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 87: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 88: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 89: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,374 INFO L273 TraceCheckUtils]: 90: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 91: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 92: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 93: Hoare triple {5722#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 94: Hoare triple {5722#false} assume !(~i~0 < 100000); {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 95: Hoare triple {5722#false} havoc ~x~0;~x~0 := 0; {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 96: Hoare triple {5722#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L256 TraceCheckUtils]: 97: Hoare triple {5722#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 98: Hoare triple {5722#false} ~cond := #in~cond; {5722#false} is VALID [2018-11-23 12:03:18,375 INFO L273 TraceCheckUtils]: 99: Hoare triple {5722#false} assume 0 == ~cond; {5722#false} is VALID [2018-11-23 12:03:18,376 INFO L273 TraceCheckUtils]: 100: Hoare triple {5722#false} assume !false; {5722#false} is VALID [2018-11-23 12:03:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:03:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:03:18,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 12:03:18,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:18,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:03:18,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:18,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:03:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:03:18,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:03:18,438 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 12 states. [2018-11-23 12:03:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,684 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2018-11-23 12:03:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:03:19,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 12:03:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:03:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2018-11-23 12:03:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:03:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2018-11-23 12:03:19,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 168 transitions. [2018-11-23 12:03:19,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:19,890 INFO L225 Difference]: With dead ends: 206 [2018-11-23 12:03:19,890 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 12:03:19,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:03:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 12:03:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-23 12:03:20,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:20,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2018-11-23 12:03:20,095 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-23 12:03:20,095 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-23 12:03:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:20,097 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-23 12:03:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-23 12:03:20,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:20,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:20,098 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-23 12:03:20,098 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-23 12:03:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:20,101 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-23 12:03:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-23 12:03:20,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:20,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:20,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:20,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:03:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-23 12:03:20,104 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 101 [2018-11-23 12:03:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:20,105 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-23 12:03:20,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:03:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-23 12:03:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:03:20,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:20,106 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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, 1, 1, 1, 1] [2018-11-23 12:03:20,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:20,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1838619322, now seen corresponding path program 9 times [2018-11-23 12:03:20,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:20,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:20,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:21,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {6855#true} call ULTIMATE.init(); {6855#true} is VALID [2018-11-23 12:03:21,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {6855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6855#true} is VALID [2018-11-23 12:03:21,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {6855#true} assume true; {6855#true} is VALID [2018-11-23 12:03:21,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6855#true} {6855#true} #152#return; {6855#true} is VALID [2018-11-23 12:03:21,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {6855#true} call #t~ret2 := main(); {6855#true} is VALID [2018-11-23 12:03:21,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {6855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6857#(= main_~i~0 0)} is VALID [2018-11-23 12:03:21,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {6857#(= 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; {6858#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:21,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {6858#(<= 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; {6859#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:21,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {6859#(<= 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; {6860#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:21,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {6860#(<= 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; {6861#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:21,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {6861#(<= 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; {6862#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:21,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {6862#(<= 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; {6863#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:21,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {6863#(<= 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; {6864#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:21,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {6864#(<= 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; {6865#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:21,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {6865#(<= 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; {6866#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:21,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {6866#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 39: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 40: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 41: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 42: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 45: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 46: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 48: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 49: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 51: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 53: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 54: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 55: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 59: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,067 INFO L273 TraceCheckUtils]: 60: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 61: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 64: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 66: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 67: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 68: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 70: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 71: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 72: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 73: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 74: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 75: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 76: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,069 INFO L273 TraceCheckUtils]: 77: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 78: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 79: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 80: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 81: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 82: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 83: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 84: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,070 INFO L273 TraceCheckUtils]: 85: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 86: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 87: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 88: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 89: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 90: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 91: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 92: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 93: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,071 INFO L273 TraceCheckUtils]: 94: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 95: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 96: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 97: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 98: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 99: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 100: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 101: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,072 INFO L273 TraceCheckUtils]: 102: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L273 TraceCheckUtils]: 103: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L273 TraceCheckUtils]: 104: Hoare triple {6856#false} havoc ~x~0;~x~0 := 0; {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L273 TraceCheckUtils]: 105: Hoare triple {6856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L256 TraceCheckUtils]: 106: Hoare triple {6856#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L273 TraceCheckUtils]: 107: Hoare triple {6856#false} ~cond := #in~cond; {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L273 TraceCheckUtils]: 108: Hoare triple {6856#false} assume 0 == ~cond; {6856#false} is VALID [2018-11-23 12:03:21,073 INFO L273 TraceCheckUtils]: 109: Hoare triple {6856#false} assume !false; {6856#false} is VALID [2018-11-23 12:03:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-23 12:03:21,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:21,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:21,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:46,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:03:46,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:46,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:46,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {6855#true} call ULTIMATE.init(); {6855#true} is VALID [2018-11-23 12:03:46,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {6855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6855#true} is VALID [2018-11-23 12:03:46,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {6855#true} assume true; {6855#true} is VALID [2018-11-23 12:03:46,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6855#true} {6855#true} #152#return; {6855#true} is VALID [2018-11-23 12:03:46,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {6855#true} call #t~ret2 := main(); {6855#true} is VALID [2018-11-23 12:03:46,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {6855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6855#true} is VALID [2018-11-23 12:03:46,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {6855#true} assume !(~i~0 < 100000); {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {6855#true} ~i~0 := 0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {6855#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6855#true} is VALID [2018-11-23 12:03:46,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {6855#true} assume !(~i~0 < 100000); {6855#true} is VALID [2018-11-23 12:03:46,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {6855#true} ~i~0 := 0; {6951#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:46,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {6951#(<= 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; {6858#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:46,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {6858#(<= 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; {6859#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:46,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {6859#(<= 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; {6860#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:46,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {6860#(<= 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; {6861#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:46,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {6861#(<= 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; {6862#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:46,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {6862#(<= 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; {6863#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:46,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {6863#(<= 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; {6864#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:46,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {6864#(<= 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; {6865#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:46,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {6865#(<= 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; {6866#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:46,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {6866#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,278 INFO L273 TraceCheckUtils]: 41: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,278 INFO L273 TraceCheckUtils]: 42: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,279 INFO L273 TraceCheckUtils]: 46: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,280 INFO L273 TraceCheckUtils]: 49: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,280 INFO L273 TraceCheckUtils]: 50: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 58: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,281 INFO L273 TraceCheckUtils]: 59: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 61: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 62: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 63: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 64: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 65: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,282 INFO L273 TraceCheckUtils]: 66: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,283 INFO L273 TraceCheckUtils]: 67: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,283 INFO L273 TraceCheckUtils]: 68: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,283 INFO L273 TraceCheckUtils]: 70: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,283 INFO L273 TraceCheckUtils]: 71: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,284 INFO L273 TraceCheckUtils]: 72: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,284 INFO L273 TraceCheckUtils]: 73: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,284 INFO L273 TraceCheckUtils]: 74: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,284 INFO L273 TraceCheckUtils]: 75: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,284 INFO L273 TraceCheckUtils]: 76: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,284 INFO L273 TraceCheckUtils]: 77: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,285 INFO L273 TraceCheckUtils]: 78: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,285 INFO L273 TraceCheckUtils]: 79: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,285 INFO L273 TraceCheckUtils]: 80: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,285 INFO L273 TraceCheckUtils]: 81: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,285 INFO L273 TraceCheckUtils]: 82: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,285 INFO L273 TraceCheckUtils]: 83: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,286 INFO L273 TraceCheckUtils]: 84: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,286 INFO L273 TraceCheckUtils]: 85: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,286 INFO L273 TraceCheckUtils]: 86: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,286 INFO L273 TraceCheckUtils]: 87: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,286 INFO L273 TraceCheckUtils]: 88: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,286 INFO L273 TraceCheckUtils]: 89: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,287 INFO L273 TraceCheckUtils]: 90: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,287 INFO L273 TraceCheckUtils]: 91: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,287 INFO L273 TraceCheckUtils]: 92: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,287 INFO L273 TraceCheckUtils]: 93: Hoare triple {6856#false} ~i~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,287 INFO L273 TraceCheckUtils]: 94: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,287 INFO L273 TraceCheckUtils]: 95: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,288 INFO L273 TraceCheckUtils]: 96: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,288 INFO L273 TraceCheckUtils]: 97: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,288 INFO L273 TraceCheckUtils]: 98: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,288 INFO L273 TraceCheckUtils]: 99: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,288 INFO L273 TraceCheckUtils]: 100: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,288 INFO L273 TraceCheckUtils]: 101: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,289 INFO L273 TraceCheckUtils]: 102: Hoare triple {6856#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6856#false} is VALID [2018-11-23 12:03:46,289 INFO L273 TraceCheckUtils]: 103: Hoare triple {6856#false} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:03:46,289 INFO L273 TraceCheckUtils]: 104: Hoare triple {6856#false} havoc ~x~0;~x~0 := 0; {6856#false} is VALID [2018-11-23 12:03:46,289 INFO L273 TraceCheckUtils]: 105: Hoare triple {6856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6856#false} is VALID [2018-11-23 12:03:46,289 INFO L256 TraceCheckUtils]: 106: Hoare triple {6856#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {6856#false} is VALID [2018-11-23 12:03:46,289 INFO L273 TraceCheckUtils]: 107: Hoare triple {6856#false} ~cond := #in~cond; {6856#false} is VALID [2018-11-23 12:03:46,290 INFO L273 TraceCheckUtils]: 108: Hoare triple {6856#false} assume 0 == ~cond; {6856#false} is VALID [2018-11-23 12:03:46,290 INFO L273 TraceCheckUtils]: 109: Hoare triple {6856#false} assume !false; {6856#false} is VALID [2018-11-23 12:03:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-23 12:03:46,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:46,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:03:46,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2018-11-23 12:03:46,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:46,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:03:46,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:46,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:03:46,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:03:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:46,390 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 13 states. [2018-11-23 12:03:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:47,079 INFO L93 Difference]: Finished difference Result 223 states and 249 transitions. [2018-11-23 12:03:47,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:03:47,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2018-11-23 12:03:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2018-11-23 12:03:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2018-11-23 12:03:47,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 177 transitions. [2018-11-23 12:03:47,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:47,286 INFO L225 Difference]: With dead ends: 223 [2018-11-23 12:03:47,286 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 12:03:47,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 12:03:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-23 12:03:47,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:47,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 124 states. [2018-11-23 12:03:47,504 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 124 states. [2018-11-23 12:03:47,504 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 124 states. [2018-11-23 12:03:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:47,507 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-23 12:03:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-11-23 12:03:47,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:47,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:47,507 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 124 states. [2018-11-23 12:03:47,507 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 124 states. [2018-11-23 12:03:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:47,510 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-23 12:03:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-11-23 12:03:47,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:47,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:47,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:47,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 12:03:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-11-23 12:03:47,514 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 110 [2018-11-23 12:03:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:47,514 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-11-23 12:03:47,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:03:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-11-23 12:03:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 12:03:47,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:47,516 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:47,516 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:47,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1132012590, now seen corresponding path program 10 times [2018-11-23 12:03:47,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:47,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:47,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:48,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {8087#true} call ULTIMATE.init(); {8087#true} is VALID [2018-11-23 12:03:48,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {8087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8087#true} is VALID [2018-11-23 12:03:48,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {8087#true} assume true; {8087#true} is VALID [2018-11-23 12:03:48,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8087#true} {8087#true} #152#return; {8087#true} is VALID [2018-11-23 12:03:48,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {8087#true} call #t~ret2 := main(); {8087#true} is VALID [2018-11-23 12:03:48,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {8087#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8089#(= main_~i~0 0)} is VALID [2018-11-23 12:03:48,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {8089#(= 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; {8090#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:48,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {8090#(<= 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; {8091#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:48,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {8091#(<= 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; {8092#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:48,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {8092#(<= 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; {8093#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:48,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {8093#(<= 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; {8094#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:48,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {8094#(<= 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; {8095#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:48,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {8095#(<= 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; {8096#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:48,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {8096#(<= 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; {8097#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:48,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {8097#(<= 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; {8098#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:48,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {8098#(<= 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; {8099#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:48,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {8099#(<= main_~i~0 10)} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,876 INFO L273 TraceCheckUtils]: 29: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,878 INFO L273 TraceCheckUtils]: 41: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 48: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 49: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 50: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,879 INFO L273 TraceCheckUtils]: 51: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,880 INFO L273 TraceCheckUtils]: 52: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,880 INFO L273 TraceCheckUtils]: 53: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,880 INFO L273 TraceCheckUtils]: 54: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,880 INFO L273 TraceCheckUtils]: 55: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,880 INFO L273 TraceCheckUtils]: 56: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,880 INFO L273 TraceCheckUtils]: 57: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 58: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 59: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 63: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,881 INFO L273 TraceCheckUtils]: 64: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,882 INFO L273 TraceCheckUtils]: 65: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,882 INFO L273 TraceCheckUtils]: 66: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,882 INFO L273 TraceCheckUtils]: 67: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,882 INFO L273 TraceCheckUtils]: 68: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,882 INFO L273 TraceCheckUtils]: 69: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,882 INFO L273 TraceCheckUtils]: 70: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 71: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 72: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 73: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 74: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 75: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 76: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,883 INFO L273 TraceCheckUtils]: 77: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,884 INFO L273 TraceCheckUtils]: 78: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,884 INFO L273 TraceCheckUtils]: 79: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,884 INFO L273 TraceCheckUtils]: 80: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,884 INFO L273 TraceCheckUtils]: 81: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,884 INFO L273 TraceCheckUtils]: 82: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,884 INFO L273 TraceCheckUtils]: 83: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,885 INFO L273 TraceCheckUtils]: 84: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,885 INFO L273 TraceCheckUtils]: 85: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,885 INFO L273 TraceCheckUtils]: 86: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,885 INFO L273 TraceCheckUtils]: 87: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,885 INFO L273 TraceCheckUtils]: 88: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,885 INFO L273 TraceCheckUtils]: 89: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 90: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 91: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 92: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 93: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 94: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 95: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,886 INFO L273 TraceCheckUtils]: 96: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 97: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 98: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 99: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 100: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 101: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 102: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,887 INFO L273 TraceCheckUtils]: 103: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,888 INFO L273 TraceCheckUtils]: 104: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,888 INFO L273 TraceCheckUtils]: 105: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,888 INFO L273 TraceCheckUtils]: 106: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,888 INFO L273 TraceCheckUtils]: 107: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,888 INFO L273 TraceCheckUtils]: 108: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,888 INFO L273 TraceCheckUtils]: 109: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L273 TraceCheckUtils]: 110: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L273 TraceCheckUtils]: 111: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L273 TraceCheckUtils]: 112: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L273 TraceCheckUtils]: 113: Hoare triple {8088#false} havoc ~x~0;~x~0 := 0; {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L273 TraceCheckUtils]: 114: Hoare triple {8088#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L256 TraceCheckUtils]: 115: Hoare triple {8088#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {8088#false} is VALID [2018-11-23 12:03:48,889 INFO L273 TraceCheckUtils]: 116: Hoare triple {8088#false} ~cond := #in~cond; {8088#false} is VALID [2018-11-23 12:03:48,890 INFO L273 TraceCheckUtils]: 117: Hoare triple {8088#false} assume 0 == ~cond; {8088#false} is VALID [2018-11-23 12:03:48,890 INFO L273 TraceCheckUtils]: 118: Hoare triple {8088#false} assume !false; {8088#false} is VALID [2018-11-23 12:03:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-23 12:03:48,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:48,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:49,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:49,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:49,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:49,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {8087#true} call ULTIMATE.init(); {8087#true} is VALID [2018-11-23 12:03:49,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {8087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8087#true} is VALID [2018-11-23 12:03:49,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {8087#true} assume true; {8087#true} is VALID [2018-11-23 12:03:49,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8087#true} {8087#true} #152#return; {8087#true} is VALID [2018-11-23 12:03:49,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {8087#true} call #t~ret2 := main(); {8087#true} is VALID [2018-11-23 12:03:49,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {8087#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8118#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:49,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {8118#(<= 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; {8090#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:49,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {8090#(<= 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; {8091#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:49,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {8091#(<= 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; {8092#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:49,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {8092#(<= 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; {8093#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:49,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {8093#(<= 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; {8094#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:49,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {8094#(<= 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; {8095#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:49,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {8095#(<= 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; {8096#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:49,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {8096#(<= 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; {8097#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:49,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {8097#(<= 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; {8098#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:49,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {8098#(<= 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; {8099#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:49,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {8099#(<= main_~i~0 10)} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,329 INFO L273 TraceCheckUtils]: 29: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,329 INFO L273 TraceCheckUtils]: 30: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,329 INFO L273 TraceCheckUtils]: 31: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 51: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,333 INFO L273 TraceCheckUtils]: 53: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,333 INFO L273 TraceCheckUtils]: 55: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,333 INFO L273 TraceCheckUtils]: 56: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,333 INFO L273 TraceCheckUtils]: 57: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,333 INFO L273 TraceCheckUtils]: 58: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 59: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 60: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 61: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 63: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 64: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,334 INFO L273 TraceCheckUtils]: 65: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 66: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 67: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 68: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 69: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 70: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 71: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,335 INFO L273 TraceCheckUtils]: 72: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,336 INFO L273 TraceCheckUtils]: 73: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,336 INFO L273 TraceCheckUtils]: 74: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,336 INFO L273 TraceCheckUtils]: 75: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,336 INFO L273 TraceCheckUtils]: 76: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,336 INFO L273 TraceCheckUtils]: 77: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,336 INFO L273 TraceCheckUtils]: 78: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 79: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 80: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 81: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 82: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 83: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 84: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,337 INFO L273 TraceCheckUtils]: 85: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,338 INFO L273 TraceCheckUtils]: 86: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,338 INFO L273 TraceCheckUtils]: 87: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,338 INFO L273 TraceCheckUtils]: 88: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,338 INFO L273 TraceCheckUtils]: 90: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,338 INFO L273 TraceCheckUtils]: 91: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 92: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 93: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 94: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 95: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 96: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 97: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,339 INFO L273 TraceCheckUtils]: 98: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,340 INFO L273 TraceCheckUtils]: 99: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,340 INFO L273 TraceCheckUtils]: 100: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,340 INFO L273 TraceCheckUtils]: 101: Hoare triple {8088#false} ~i~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,340 INFO L273 TraceCheckUtils]: 102: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,340 INFO L273 TraceCheckUtils]: 103: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,340 INFO L273 TraceCheckUtils]: 104: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 105: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 106: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 107: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 108: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 109: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 110: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,341 INFO L273 TraceCheckUtils]: 111: Hoare triple {8088#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#false} is VALID [2018-11-23 12:03:49,342 INFO L273 TraceCheckUtils]: 112: Hoare triple {8088#false} assume !(~i~0 < 100000); {8088#false} is VALID [2018-11-23 12:03:49,342 INFO L273 TraceCheckUtils]: 113: Hoare triple {8088#false} havoc ~x~0;~x~0 := 0; {8088#false} is VALID [2018-11-23 12:03:49,342 INFO L273 TraceCheckUtils]: 114: Hoare triple {8088#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8088#false} is VALID [2018-11-23 12:03:49,342 INFO L256 TraceCheckUtils]: 115: Hoare triple {8088#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {8088#false} is VALID [2018-11-23 12:03:49,342 INFO L273 TraceCheckUtils]: 116: Hoare triple {8088#false} ~cond := #in~cond; {8088#false} is VALID [2018-11-23 12:03:49,342 INFO L273 TraceCheckUtils]: 117: Hoare triple {8088#false} assume 0 == ~cond; {8088#false} is VALID [2018-11-23 12:03:49,343 INFO L273 TraceCheckUtils]: 118: Hoare triple {8088#false} assume !false; {8088#false} is VALID [2018-11-23 12:03:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-23 12:03:49,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:49,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:03:49,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2018-11-23 12:03:49,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:49,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:03:49,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:49,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:03:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:03:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:49,445 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 14 states. [2018-11-23 12:03:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:50,927 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2018-11-23 12:03:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:03:50,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2018-11-23 12:03:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2018-11-23 12:03:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2018-11-23 12:03:50,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 186 transitions. [2018-11-23 12:03:51,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:51,523 INFO L225 Difference]: With dead ends: 240 [2018-11-23 12:03:51,524 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:03:51,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:03:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-23 12:03:51,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:51,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 133 states. [2018-11-23 12:03:51,688 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 133 states. [2018-11-23 12:03:51,688 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 133 states. [2018-11-23 12:03:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:51,692 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-11-23 12:03:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2018-11-23 12:03:51,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:51,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:51,693 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 133 states. [2018-11-23 12:03:51,693 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 133 states. [2018-11-23 12:03:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:51,696 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-11-23 12:03:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2018-11-23 12:03:51,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:51,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:51,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:51,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 12:03:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2018-11-23 12:03:51,700 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 119 [2018-11-23 12:03:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:51,700 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2018-11-23 12:03:51,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:03:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2018-11-23 12:03:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:03:51,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:51,702 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:51,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:51,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1513332922, now seen corresponding path program 11 times [2018-11-23 12:03:51,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:51,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:51,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:52,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {9417#true} call ULTIMATE.init(); {9417#true} is VALID [2018-11-23 12:03:52,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {9417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9417#true} is VALID [2018-11-23 12:03:52,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {9417#true} assume true; {9417#true} is VALID [2018-11-23 12:03:52,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9417#true} {9417#true} #152#return; {9417#true} is VALID [2018-11-23 12:03:52,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {9417#true} call #t~ret2 := main(); {9417#true} is VALID [2018-11-23 12:03:52,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {9417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9419#(= main_~i~0 0)} is VALID [2018-11-23 12:03:52,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {9419#(= 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; {9420#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:52,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {9420#(<= 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; {9421#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:52,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {9421#(<= 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; {9422#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:52,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {9422#(<= 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; {9423#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:52,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {9423#(<= 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; {9424#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:52,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {9424#(<= 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; {9425#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:52,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {9425#(<= 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; {9426#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:52,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {9426#(<= 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; {9427#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:52,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {9427#(<= 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; {9428#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:52,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {9428#(<= 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; {9429#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:52,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {9429#(<= 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; {9430#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:52,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {9430#(<= main_~i~0 11)} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 33: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 34: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,348 INFO L273 TraceCheckUtils]: 48: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 49: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 52: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,349 INFO L273 TraceCheckUtils]: 57: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 60: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 61: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 62: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 63: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 64: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,350 INFO L273 TraceCheckUtils]: 65: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 66: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 67: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 68: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 69: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 70: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 71: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 72: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,351 INFO L273 TraceCheckUtils]: 73: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 74: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 75: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 76: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 77: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 78: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 79: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 80: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 81: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,352 INFO L273 TraceCheckUtils]: 82: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,353 INFO L273 TraceCheckUtils]: 83: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,353 INFO L273 TraceCheckUtils]: 84: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,353 INFO L273 TraceCheckUtils]: 85: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,353 INFO L273 TraceCheckUtils]: 86: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,353 INFO L273 TraceCheckUtils]: 87: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,353 INFO L273 TraceCheckUtils]: 88: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,354 INFO L273 TraceCheckUtils]: 89: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,354 INFO L273 TraceCheckUtils]: 90: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,354 INFO L273 TraceCheckUtils]: 91: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,354 INFO L273 TraceCheckUtils]: 92: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,354 INFO L273 TraceCheckUtils]: 93: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,355 INFO L273 TraceCheckUtils]: 94: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,355 INFO L273 TraceCheckUtils]: 95: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,355 INFO L273 TraceCheckUtils]: 96: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,355 INFO L273 TraceCheckUtils]: 97: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,355 INFO L273 TraceCheckUtils]: 98: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,355 INFO L273 TraceCheckUtils]: 99: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,356 INFO L273 TraceCheckUtils]: 100: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,356 INFO L273 TraceCheckUtils]: 101: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,356 INFO L273 TraceCheckUtils]: 102: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,356 INFO L273 TraceCheckUtils]: 103: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,356 INFO L273 TraceCheckUtils]: 104: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,356 INFO L273 TraceCheckUtils]: 105: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,357 INFO L273 TraceCheckUtils]: 106: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,357 INFO L273 TraceCheckUtils]: 107: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,357 INFO L273 TraceCheckUtils]: 108: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,357 INFO L273 TraceCheckUtils]: 109: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,357 INFO L273 TraceCheckUtils]: 110: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,357 INFO L273 TraceCheckUtils]: 111: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,358 INFO L273 TraceCheckUtils]: 112: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,358 INFO L273 TraceCheckUtils]: 113: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,358 INFO L273 TraceCheckUtils]: 114: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,358 INFO L273 TraceCheckUtils]: 115: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,358 INFO L273 TraceCheckUtils]: 116: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,358 INFO L273 TraceCheckUtils]: 117: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,359 INFO L273 TraceCheckUtils]: 118: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,359 INFO L273 TraceCheckUtils]: 119: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,359 INFO L273 TraceCheckUtils]: 120: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:03:52,359 INFO L273 TraceCheckUtils]: 121: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:03:52,359 INFO L273 TraceCheckUtils]: 122: Hoare triple {9418#false} havoc ~x~0;~x~0 := 0; {9418#false} is VALID [2018-11-23 12:03:52,359 INFO L273 TraceCheckUtils]: 123: Hoare triple {9418#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9418#false} is VALID [2018-11-23 12:03:52,360 INFO L256 TraceCheckUtils]: 124: Hoare triple {9418#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {9418#false} is VALID [2018-11-23 12:03:52,360 INFO L273 TraceCheckUtils]: 125: Hoare triple {9418#false} ~cond := #in~cond; {9418#false} is VALID [2018-11-23 12:03:52,360 INFO L273 TraceCheckUtils]: 126: Hoare triple {9418#false} assume 0 == ~cond; {9418#false} is VALID [2018-11-23 12:03:52,360 INFO L273 TraceCheckUtils]: 127: Hoare triple {9418#false} assume !false; {9418#false} is VALID [2018-11-23 12:03:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-23 12:03:52,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:52,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:52,385 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:45,390 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:04:45,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:45,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:45,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {9417#true} call ULTIMATE.init(); {9417#true} is VALID [2018-11-23 12:04:45,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {9417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9417#true} is VALID [2018-11-23 12:04:45,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {9417#true} assume true; {9417#true} is VALID [2018-11-23 12:04:45,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9417#true} {9417#true} #152#return; {9417#true} is VALID [2018-11-23 12:04:45,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {9417#true} call #t~ret2 := main(); {9417#true} is VALID [2018-11-23 12:04:45,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {9417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9417#true} is VALID [2018-11-23 12:04:45,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {9417#true} assume !(~i~0 < 100000); {9417#true} is VALID [2018-11-23 12:04:45,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {9417#true} ~i~0 := 0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {9417#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#true} is VALID [2018-11-23 12:04:45,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {9417#true} assume !(~i~0 < 100000); {9417#true} is VALID [2018-11-23 12:04:45,631 INFO L273 TraceCheckUtils]: 31: Hoare triple {9417#true} ~i~0 := 0; {9527#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:45,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {9527#(<= 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; {9420#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:45,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {9420#(<= 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; {9421#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:45,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {9421#(<= 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; {9422#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:45,634 INFO L273 TraceCheckUtils]: 35: Hoare triple {9422#(<= 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; {9423#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:45,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {9423#(<= 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; {9424#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:45,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {9424#(<= 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; {9425#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:45,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {9425#(<= 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; {9426#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:45,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {9426#(<= 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; {9427#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:45,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {9427#(<= 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; {9428#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:45,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {9428#(<= 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; {9429#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:45,640 INFO L273 TraceCheckUtils]: 42: Hoare triple {9429#(<= 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; {9430#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:45,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {9430#(<= main_~i~0 11)} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,641 INFO L273 TraceCheckUtils]: 44: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 62: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 66: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 67: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 69: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 70: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 71: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 73: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 74: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 75: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,646 INFO L273 TraceCheckUtils]: 76: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 77: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 78: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 81: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 82: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 83: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,647 INFO L273 TraceCheckUtils]: 85: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 86: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 87: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 88: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 89: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 90: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 91: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 94: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 98: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 99: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 100: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 101: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,649 INFO L273 TraceCheckUtils]: 102: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 103: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 104: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 105: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 106: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 107: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 108: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 109: Hoare triple {9418#false} ~i~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 111: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 112: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 113: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 114: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 115: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 116: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 117: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 118: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,651 INFO L273 TraceCheckUtils]: 119: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 120: Hoare triple {9418#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 121: Hoare triple {9418#false} assume !(~i~0 < 100000); {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 122: Hoare triple {9418#false} havoc ~x~0;~x~0 := 0; {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 123: Hoare triple {9418#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L256 TraceCheckUtils]: 124: Hoare triple {9418#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 125: Hoare triple {9418#false} ~cond := #in~cond; {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 126: Hoare triple {9418#false} assume 0 == ~cond; {9418#false} is VALID [2018-11-23 12:04:45,652 INFO L273 TraceCheckUtils]: 127: Hoare triple {9418#false} assume !false; {9418#false} is VALID [2018-11-23 12:04:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-23 12:04:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:45,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:04:45,689 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 128 [2018-11-23 12:04:45,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:45,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:04:45,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:45,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:04:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:04:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:04:45,754 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand 15 states. [2018-11-23 12:04:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:46,841 INFO L93 Difference]: Finished difference Result 257 states and 283 transitions. [2018-11-23 12:04:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:04:46,842 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 128 [2018-11-23 12:04:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:04:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 195 transitions. [2018-11-23 12:04:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:04:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 195 transitions. [2018-11-23 12:04:46,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 195 transitions. [2018-11-23 12:04:47,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:47,509 INFO L225 Difference]: With dead ends: 257 [2018-11-23 12:04:47,509 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 12:04:47,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:04:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 12:04:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-23 12:04:47,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:47,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 142 states. [2018-11-23 12:04:47,603 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 12:04:47,603 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 12:04:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:47,606 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-23 12:04:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-23 12:04:47,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:47,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:47,607 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 12:04:47,608 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 12:04:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:47,610 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-23 12:04:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-23 12:04:47,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:47,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:47,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:47,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 12:04:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-11-23 12:04:47,614 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 128 [2018-11-23 12:04:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:47,615 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-11-23 12:04:47,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:04:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-23 12:04:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 12:04:47,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:47,616 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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, 1, 1, 1, 1] [2018-11-23 12:04:47,617 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:47,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 892014802, now seen corresponding path program 12 times [2018-11-23 12:04:47,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:47,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:47,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:48,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2018-11-23 12:04:48,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10845#true} is VALID [2018-11-23 12:04:48,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {10845#true} assume true; {10845#true} is VALID [2018-11-23 12:04:48,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10845#true} {10845#true} #152#return; {10845#true} is VALID [2018-11-23 12:04:48,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {10845#true} call #t~ret2 := main(); {10845#true} is VALID [2018-11-23 12:04:48,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {10845#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10847#(= main_~i~0 0)} is VALID [2018-11-23 12:04:48,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {10847#(= 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; {10848#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:48,194 INFO L273 TraceCheckUtils]: 7: Hoare triple {10848#(<= 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; {10849#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:48,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {10849#(<= 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; {10850#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:48,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {10850#(<= 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; {10851#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:48,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {10851#(<= 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; {10852#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:48,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {10852#(<= 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; {10853#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:48,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {10853#(<= 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; {10854#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:48,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {10854#(<= 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; {10855#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:48,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {10855#(<= 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; {10856#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:48,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {10856#(<= 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; {10857#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:48,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {10857#(<= 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; {10858#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:48,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {10858#(<= 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; {10859#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:48,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {10859#(<= main_~i~0 12)} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,207 INFO L273 TraceCheckUtils]: 34: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,208 INFO L273 TraceCheckUtils]: 35: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,208 INFO L273 TraceCheckUtils]: 36: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,208 INFO L273 TraceCheckUtils]: 37: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 43: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 46: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 54: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,210 INFO L273 TraceCheckUtils]: 55: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 60: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 61: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 62: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 63: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,211 INFO L273 TraceCheckUtils]: 64: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 65: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 66: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 67: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 68: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 69: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 70: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 73: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 75: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 78: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 79: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,213 INFO L273 TraceCheckUtils]: 81: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 82: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 83: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 84: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 85: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 88: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 90: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 92: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 93: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 94: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 95: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 99: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 101: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 103: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 104: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 105: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,216 INFO L273 TraceCheckUtils]: 106: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 107: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 108: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 109: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 111: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 112: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 113: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 114: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,217 INFO L273 TraceCheckUtils]: 115: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 116: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 117: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 118: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 119: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 120: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 121: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 122: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,218 INFO L273 TraceCheckUtils]: 123: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 124: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 125: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 126: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 127: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 128: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 129: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 130: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 131: Hoare triple {10846#false} havoc ~x~0;~x~0 := 0; {10846#false} is VALID [2018-11-23 12:04:48,219 INFO L273 TraceCheckUtils]: 132: Hoare triple {10846#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10846#false} is VALID [2018-11-23 12:04:48,220 INFO L256 TraceCheckUtils]: 133: Hoare triple {10846#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {10846#false} is VALID [2018-11-23 12:04:48,220 INFO L273 TraceCheckUtils]: 134: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2018-11-23 12:04:48,220 INFO L273 TraceCheckUtils]: 135: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2018-11-23 12:04:48,220 INFO L273 TraceCheckUtils]: 136: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2018-11-23 12:04:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-11-23 12:04:48,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:48,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:48,236 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:29,029 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:05:29,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:29,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2018-11-23 12:05:29,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10845#true} is VALID [2018-11-23 12:05:29,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {10845#true} assume true; {10845#true} is VALID [2018-11-23 12:05:29,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10845#true} {10845#true} #152#return; {10845#true} is VALID [2018-11-23 12:05:29,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {10845#true} call #t~ret2 := main(); {10845#true} is VALID [2018-11-23 12:05:29,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {10845#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10845#true} is VALID [2018-11-23 12:05:29,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {10845#true} assume !(~i~0 < 100000); {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {10845#true} ~i~0 := 0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(~i~0 < 100000); {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {10845#true} ~i~0 := 0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 46: Hoare triple {10845#true} assume !(~i~0 < 100000); {10845#true} is VALID [2018-11-23 12:05:29,361 INFO L273 TraceCheckUtils]: 47: Hoare triple {10845#true} ~i~0 := 0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 49: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 51: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 52: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 53: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 54: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,362 INFO L273 TraceCheckUtils]: 55: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,363 INFO L273 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,363 INFO L273 TraceCheckUtils]: 57: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,363 INFO L273 TraceCheckUtils]: 58: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {10845#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#true} is VALID [2018-11-23 12:05:29,363 INFO L273 TraceCheckUtils]: 60: Hoare triple {10845#true} assume !(~i~0 < 100000); {10845#true} is VALID [2018-11-23 12:05:29,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {10845#true} ~i~0 := 0; {11046#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,364 INFO L273 TraceCheckUtils]: 62: Hoare triple {11046#(<= 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; {10848#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,365 INFO L273 TraceCheckUtils]: 63: Hoare triple {10848#(<= 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; {10849#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,365 INFO L273 TraceCheckUtils]: 64: Hoare triple {10849#(<= 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; {10850#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,366 INFO L273 TraceCheckUtils]: 65: Hoare triple {10850#(<= 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; {10851#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,366 INFO L273 TraceCheckUtils]: 66: Hoare triple {10851#(<= 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; {10852#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,367 INFO L273 TraceCheckUtils]: 67: Hoare triple {10852#(<= 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; {10853#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,367 INFO L273 TraceCheckUtils]: 68: Hoare triple {10853#(<= 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; {10854#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,368 INFO L273 TraceCheckUtils]: 69: Hoare triple {10854#(<= 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; {10855#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,369 INFO L273 TraceCheckUtils]: 70: Hoare triple {10855#(<= 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; {10856#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,370 INFO L273 TraceCheckUtils]: 71: Hoare triple {10856#(<= 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; {10857#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,371 INFO L273 TraceCheckUtils]: 72: Hoare triple {10857#(<= 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; {10858#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,372 INFO L273 TraceCheckUtils]: 73: Hoare triple {10858#(<= 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; {10859#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,372 INFO L273 TraceCheckUtils]: 74: Hoare triple {10859#(<= main_~i~0 12)} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:05:29,373 INFO L273 TraceCheckUtils]: 75: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:05:29,373 INFO L273 TraceCheckUtils]: 76: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,373 INFO L273 TraceCheckUtils]: 77: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,373 INFO L273 TraceCheckUtils]: 78: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,374 INFO L273 TraceCheckUtils]: 79: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,374 INFO L273 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,374 INFO L273 TraceCheckUtils]: 81: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,374 INFO L273 TraceCheckUtils]: 83: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 85: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 87: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 88: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 89: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 90: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 91: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,375 INFO L273 TraceCheckUtils]: 92: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 93: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 94: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 95: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 96: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 97: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 98: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 99: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,376 INFO L273 TraceCheckUtils]: 100: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 101: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 102: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 103: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 104: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 105: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 106: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 107: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 108: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,377 INFO L273 TraceCheckUtils]: 109: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 110: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 111: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 112: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 113: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 114: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 115: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 116: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 117: Hoare triple {10846#false} ~i~0 := 0; {10846#false} is VALID [2018-11-23 12:05:29,378 INFO L273 TraceCheckUtils]: 118: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 119: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 120: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 121: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 122: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 123: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 124: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 125: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,379 INFO L273 TraceCheckUtils]: 126: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L273 TraceCheckUtils]: 127: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L273 TraceCheckUtils]: 128: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L273 TraceCheckUtils]: 129: Hoare triple {10846#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L273 TraceCheckUtils]: 130: Hoare triple {10846#false} assume !(~i~0 < 100000); {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L273 TraceCheckUtils]: 131: Hoare triple {10846#false} havoc ~x~0;~x~0 := 0; {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L273 TraceCheckUtils]: 132: Hoare triple {10846#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10846#false} is VALID [2018-11-23 12:05:29,380 INFO L256 TraceCheckUtils]: 133: Hoare triple {10846#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {10846#false} is VALID [2018-11-23 12:05:29,381 INFO L273 TraceCheckUtils]: 134: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2018-11-23 12:05:29,381 INFO L273 TraceCheckUtils]: 135: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2018-11-23 12:05:29,381 INFO L273 TraceCheckUtils]: 136: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2018-11-23 12:05:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-11-23 12:05:29,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:29,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:29,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 137 [2018-11-23 12:05:29,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:29,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:29,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:29,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:29,492 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 16 states. [2018-11-23 12:05:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:30,459 INFO L93 Difference]: Finished difference Result 274 states and 300 transitions. [2018-11-23 12:05:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:30,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 137 [2018-11-23 12:05:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 204 transitions. [2018-11-23 12:05:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 204 transitions. [2018-11-23 12:05:30,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 204 transitions. [2018-11-23 12:05:31,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:31,008 INFO L225 Difference]: With dead ends: 274 [2018-11-23 12:05:31,008 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 12:05:31,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 12:05:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-11-23 12:05:32,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:32,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 151 states. [2018-11-23 12:05:32,354 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 151 states. [2018-11-23 12:05:32,354 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 151 states. [2018-11-23 12:05:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,356 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-23 12:05:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-23 12:05:32,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:32,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:32,357 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 151 states. [2018-11-23 12:05:32,358 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 151 states. [2018-11-23 12:05:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,361 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-23 12:05:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-23 12:05:32,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:32,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:32,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:32,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:05:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-11-23 12:05:32,364 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 137 [2018-11-23 12:05:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:32,365 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-11-23 12:05:32,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-23 12:05:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:05:32,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:32,367 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 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, 1, 1, 1, 1] [2018-11-23 12:05:32,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:32,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1312905542, now seen corresponding path program 13 times [2018-11-23 12:05:32,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:32,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:32,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {12371#true} call ULTIMATE.init(); {12371#true} is VALID [2018-11-23 12:05:32,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {12371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12371#true} is VALID [2018-11-23 12:05:32,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {12371#true} assume true; {12371#true} is VALID [2018-11-23 12:05:32,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12371#true} {12371#true} #152#return; {12371#true} is VALID [2018-11-23 12:05:32,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {12371#true} call #t~ret2 := main(); {12371#true} is VALID [2018-11-23 12:05:32,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {12371#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12373#(= main_~i~0 0)} is VALID [2018-11-23 12:05:32,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {12373#(= 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; {12374#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {12374#(<= 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; {12375#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {12375#(<= 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; {12376#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {12376#(<= 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; {12377#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {12377#(<= 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; {12378#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {12378#(<= 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; {12379#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {12379#(<= 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; {12380#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {12380#(<= 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; {12381#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {12381#(<= 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; {12382#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {12382#(<= 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; {12383#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {12383#(<= 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; {12384#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:32,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {12384#(<= 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; {12385#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:32,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {12385#(<= 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; {12386#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:32,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {12386#(<= main_~i~0 13)} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,724 INFO L273 TraceCheckUtils]: 24: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,725 INFO L273 TraceCheckUtils]: 29: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,726 INFO L273 TraceCheckUtils]: 38: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 39: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 41: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 42: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 43: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,727 INFO L273 TraceCheckUtils]: 46: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,728 INFO L273 TraceCheckUtils]: 47: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,728 INFO L273 TraceCheckUtils]: 48: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,728 INFO L273 TraceCheckUtils]: 49: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,728 INFO L273 TraceCheckUtils]: 50: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,728 INFO L273 TraceCheckUtils]: 51: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,729 INFO L273 TraceCheckUtils]: 55: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,729 INFO L273 TraceCheckUtils]: 56: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,729 INFO L273 TraceCheckUtils]: 57: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,729 INFO L273 TraceCheckUtils]: 58: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,730 INFO L273 TraceCheckUtils]: 59: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,730 INFO L273 TraceCheckUtils]: 60: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,730 INFO L273 TraceCheckUtils]: 61: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,730 INFO L273 TraceCheckUtils]: 62: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,730 INFO L273 TraceCheckUtils]: 63: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,731 INFO L273 TraceCheckUtils]: 64: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,731 INFO L273 TraceCheckUtils]: 65: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,731 INFO L273 TraceCheckUtils]: 66: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,732 INFO L273 TraceCheckUtils]: 69: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,732 INFO L273 TraceCheckUtils]: 70: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,732 INFO L273 TraceCheckUtils]: 71: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,732 INFO L273 TraceCheckUtils]: 72: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,732 INFO L273 TraceCheckUtils]: 73: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,732 INFO L273 TraceCheckUtils]: 74: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,733 INFO L273 TraceCheckUtils]: 75: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,733 INFO L273 TraceCheckUtils]: 76: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,733 INFO L273 TraceCheckUtils]: 77: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,733 INFO L273 TraceCheckUtils]: 78: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,733 INFO L273 TraceCheckUtils]: 80: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,734 INFO L273 TraceCheckUtils]: 82: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,734 INFO L273 TraceCheckUtils]: 84: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,734 INFO L273 TraceCheckUtils]: 85: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,735 INFO L273 TraceCheckUtils]: 87: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,735 INFO L273 TraceCheckUtils]: 88: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,735 INFO L273 TraceCheckUtils]: 89: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,735 INFO L273 TraceCheckUtils]: 90: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,735 INFO L273 TraceCheckUtils]: 91: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,736 INFO L273 TraceCheckUtils]: 92: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,736 INFO L273 TraceCheckUtils]: 93: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,736 INFO L273 TraceCheckUtils]: 94: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,736 INFO L273 TraceCheckUtils]: 95: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,736 INFO L273 TraceCheckUtils]: 96: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,736 INFO L273 TraceCheckUtils]: 97: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 98: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 99: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 100: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 101: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 102: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 103: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,737 INFO L273 TraceCheckUtils]: 104: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,738 INFO L273 TraceCheckUtils]: 105: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,738 INFO L273 TraceCheckUtils]: 106: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,738 INFO L273 TraceCheckUtils]: 107: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,738 INFO L273 TraceCheckUtils]: 108: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,738 INFO L273 TraceCheckUtils]: 109: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,738 INFO L273 TraceCheckUtils]: 110: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,739 INFO L273 TraceCheckUtils]: 111: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,739 INFO L273 TraceCheckUtils]: 112: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,739 INFO L273 TraceCheckUtils]: 113: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,739 INFO L273 TraceCheckUtils]: 114: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,739 INFO L273 TraceCheckUtils]: 115: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,739 INFO L273 TraceCheckUtils]: 116: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,740 INFO L273 TraceCheckUtils]: 117: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,740 INFO L273 TraceCheckUtils]: 118: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,740 INFO L273 TraceCheckUtils]: 119: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,740 INFO L273 TraceCheckUtils]: 120: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,740 INFO L273 TraceCheckUtils]: 121: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,740 INFO L273 TraceCheckUtils]: 122: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,741 INFO L273 TraceCheckUtils]: 123: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,741 INFO L273 TraceCheckUtils]: 124: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,741 INFO L273 TraceCheckUtils]: 125: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,741 INFO L273 TraceCheckUtils]: 126: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,741 INFO L273 TraceCheckUtils]: 127: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,741 INFO L273 TraceCheckUtils]: 128: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,742 INFO L273 TraceCheckUtils]: 129: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,742 INFO L273 TraceCheckUtils]: 130: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,742 INFO L273 TraceCheckUtils]: 131: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,742 INFO L273 TraceCheckUtils]: 132: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,742 INFO L273 TraceCheckUtils]: 133: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,742 INFO L273 TraceCheckUtils]: 134: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,743 INFO L273 TraceCheckUtils]: 135: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,743 INFO L273 TraceCheckUtils]: 136: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,743 INFO L273 TraceCheckUtils]: 137: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,743 INFO L273 TraceCheckUtils]: 138: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:32,743 INFO L273 TraceCheckUtils]: 139: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:32,743 INFO L273 TraceCheckUtils]: 140: Hoare triple {12372#false} havoc ~x~0;~x~0 := 0; {12372#false} is VALID [2018-11-23 12:05:32,744 INFO L273 TraceCheckUtils]: 141: Hoare triple {12372#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12372#false} is VALID [2018-11-23 12:05:32,744 INFO L256 TraceCheckUtils]: 142: Hoare triple {12372#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {12372#false} is VALID [2018-11-23 12:05:32,744 INFO L273 TraceCheckUtils]: 143: Hoare triple {12372#false} ~cond := #in~cond; {12372#false} is VALID [2018-11-23 12:05:32,744 INFO L273 TraceCheckUtils]: 144: Hoare triple {12372#false} assume 0 == ~cond; {12372#false} is VALID [2018-11-23 12:05:32,744 INFO L273 TraceCheckUtils]: 145: Hoare triple {12372#false} assume !false; {12372#false} is VALID [2018-11-23 12:05:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-11-23 12:05:32,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:32,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:32,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:32,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:33,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {12371#true} call ULTIMATE.init(); {12371#true} is VALID [2018-11-23 12:05:33,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {12371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12371#true} is VALID [2018-11-23 12:05:33,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {12371#true} assume true; {12371#true} is VALID [2018-11-23 12:05:33,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12371#true} {12371#true} #152#return; {12371#true} is VALID [2018-11-23 12:05:33,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {12371#true} call #t~ret2 := main(); {12371#true} is VALID [2018-11-23 12:05:33,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {12371#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12405#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {12405#(<= 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; {12374#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {12374#(<= 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; {12375#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {12375#(<= 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; {12376#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {12376#(<= 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; {12377#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {12377#(<= 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; {12378#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {12378#(<= 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; {12379#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {12379#(<= 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; {12380#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {12380#(<= 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; {12381#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {12381#(<= 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; {12382#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {12382#(<= 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; {12383#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {12383#(<= 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; {12384#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {12384#(<= 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; {12385#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {12385#(<= 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; {12386#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {12386#(<= main_~i~0 13)} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 32: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 36: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,074 INFO L273 TraceCheckUtils]: 37: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 38: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 39: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 40: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 41: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 43: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 45: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,075 INFO L273 TraceCheckUtils]: 46: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 47: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 48: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 49: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,076 INFO L273 TraceCheckUtils]: 55: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 56: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 62: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 65: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 66: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 68: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 69: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 70: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 71: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,078 INFO L273 TraceCheckUtils]: 72: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 73: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 74: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 76: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 77: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 78: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 79: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,079 INFO L273 TraceCheckUtils]: 80: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 81: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 82: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 83: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 84: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 85: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 86: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 87: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 88: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,080 INFO L273 TraceCheckUtils]: 89: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 90: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 93: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 94: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 95: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 96: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 97: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,081 INFO L273 TraceCheckUtils]: 98: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 99: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 100: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 101: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 102: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 103: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 104: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 105: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 106: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,082 INFO L273 TraceCheckUtils]: 107: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 108: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 109: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 110: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 111: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 112: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 113: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 114: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,083 INFO L273 TraceCheckUtils]: 115: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 116: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 117: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 118: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 119: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 120: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 121: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 122: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 123: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,084 INFO L273 TraceCheckUtils]: 124: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 125: Hoare triple {12372#false} ~i~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 126: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 127: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 128: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 129: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 130: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 131: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 132: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 133: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 134: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 135: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 136: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 137: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 138: Hoare triple {12372#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 139: Hoare triple {12372#false} assume !(~i~0 < 100000); {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 140: Hoare triple {12372#false} havoc ~x~0;~x~0 := 0; {12372#false} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 141: Hoare triple {12372#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12372#false} is VALID [2018-11-23 12:05:33,087 INFO L256 TraceCheckUtils]: 142: Hoare triple {12372#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {12372#false} is VALID [2018-11-23 12:05:33,087 INFO L273 TraceCheckUtils]: 143: Hoare triple {12372#false} ~cond := #in~cond; {12372#false} is VALID [2018-11-23 12:05:33,087 INFO L273 TraceCheckUtils]: 144: Hoare triple {12372#false} assume 0 == ~cond; {12372#false} is VALID [2018-11-23 12:05:33,087 INFO L273 TraceCheckUtils]: 145: Hoare triple {12372#false} assume !false; {12372#false} is VALID [2018-11-23 12:05:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-11-23 12:05:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:33,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:33,116 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 146 [2018-11-23 12:05:33,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:33,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:33,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:33,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:33,298 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 17 states. [2018-11-23 12:05:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,895 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2018-11-23 12:05:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:34,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 146 [2018-11-23 12:05:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2018-11-23 12:05:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2018-11-23 12:05:34,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 213 transitions. [2018-11-23 12:05:35,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:35,130 INFO L225 Difference]: With dead ends: 291 [2018-11-23 12:05:35,130 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 12:05:35,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 12:05:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-23 12:05:35,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:35,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 160 states. [2018-11-23 12:05:35,314 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 12:05:35,314 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 12:05:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:35,317 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-11-23 12:05:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-11-23 12:05:35,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:35,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:35,318 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 12:05:35,318 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 12:05:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:35,321 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-11-23 12:05:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-11-23 12:05:35,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:35,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:35,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:35,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:05:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-11-23 12:05:35,325 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 146 [2018-11-23 12:05:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:35,325 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-11-23 12:05:35,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-11-23 12:05:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 12:05:35,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:35,327 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 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, 1, 1, 1, 1] [2018-11-23 12:05:35,327 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:35,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 305939922, now seen corresponding path program 14 times [2018-11-23 12:05:35,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:35,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:35,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-23 12:05:35,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-23 12:05:35,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-23 12:05:35,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #152#return; {13995#true} is VALID [2018-11-23 12:05:35,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret2 := main(); {13995#true} is VALID [2018-11-23 12:05:35,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13997#(= main_~i~0 0)} is VALID [2018-11-23 12:05:35,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {13997#(= 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; {13998#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {13998#(<= 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; {13999#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {13999#(<= 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; {14000#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {14000#(<= 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; {14001#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {14001#(<= 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; {14002#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {14002#(<= 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; {14003#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {14003#(<= 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; {14004#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {14004#(<= 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; {14005#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {14005#(<= 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; {14006#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {14006#(<= 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; {14007#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {14007#(<= 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; {14008#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {14008#(<= 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; {14009#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {14009#(<= 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; {14010#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {14010#(<= 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; {14011#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {14011#(<= main_~i~0 14)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,756 INFO L273 TraceCheckUtils]: 24: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,756 INFO L273 TraceCheckUtils]: 25: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 29: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 37: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 48: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,760 INFO L273 TraceCheckUtils]: 51: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 54: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 55: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 56: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 58: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 59: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,761 INFO L273 TraceCheckUtils]: 60: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 61: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 62: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 63: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 64: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 65: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 66: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 67: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,762 INFO L273 TraceCheckUtils]: 68: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 69: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 70: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 71: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 72: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 73: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 74: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 75: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 76: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,763 INFO L273 TraceCheckUtils]: 77: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 78: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 79: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 80: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 81: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 82: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 83: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 84: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 85: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,764 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 90: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 91: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 92: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 93: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 94: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,765 INFO L273 TraceCheckUtils]: 95: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 96: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 97: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 98: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 99: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 100: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 101: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 102: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,766 INFO L273 TraceCheckUtils]: 103: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 104: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 105: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 106: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 107: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 111: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,767 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 115: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 116: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 117: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 118: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 119: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 120: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,768 INFO L273 TraceCheckUtils]: 121: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 122: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 123: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 124: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 125: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 126: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 127: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 128: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 129: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,769 INFO L273 TraceCheckUtils]: 130: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 131: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 132: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 133: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 134: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 135: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 136: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 137: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,770 INFO L273 TraceCheckUtils]: 138: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 139: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 140: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 141: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 142: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 143: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 144: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 145: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 146: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,771 INFO L273 TraceCheckUtils]: 147: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 148: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 149: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 150: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L256 TraceCheckUtils]: 151: Hoare triple {13996#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 152: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 153: Hoare triple {13996#false} assume 0 == ~cond; {13996#false} is VALID [2018-11-23 12:05:35,772 INFO L273 TraceCheckUtils]: 154: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-23 12:05:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-23 12:05:35,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:35,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:35,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:35,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:36,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-23 12:05:36,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-23 12:05:36,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-23 12:05:36,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #152#return; {13995#true} is VALID [2018-11-23 12:05:36,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret2 := main(); {13995#true} is VALID [2018-11-23 12:05:36,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14030#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:36,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {14030#(<= 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; {13998#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:36,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {13998#(<= 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; {13999#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:36,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {13999#(<= 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; {14000#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:36,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {14000#(<= 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; {14001#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:36,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {14001#(<= 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; {14002#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:36,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {14002#(<= 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; {14003#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:36,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {14003#(<= 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; {14004#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:36,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {14004#(<= 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; {14005#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:36,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {14005#(<= 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; {14006#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:36,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {14006#(<= 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; {14007#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:36,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {14007#(<= 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; {14008#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:36,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {14008#(<= 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; {14009#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:36,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {14009#(<= 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; {14010#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:36,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {14010#(<= 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; {14011#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:36,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {14011#(<= main_~i~0 14)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,152 INFO L273 TraceCheckUtils]: 28: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 33: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 38: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 43: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 55: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 56: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 57: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,155 INFO L273 TraceCheckUtils]: 58: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 59: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 60: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 63: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 64: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 65: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 67: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 68: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 69: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 70: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 71: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 72: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 73: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 74: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 76: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 77: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 78: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 79: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 80: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 92: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,159 INFO L273 TraceCheckUtils]: 93: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 94: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 95: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 96: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 98: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 100: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,160 INFO L273 TraceCheckUtils]: 101: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 103: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 104: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 105: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 106: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 107: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,161 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 111: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 115: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 116: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 117: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 118: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,162 INFO L273 TraceCheckUtils]: 119: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 120: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 121: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 122: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 123: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 124: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 125: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 126: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 127: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,163 INFO L273 TraceCheckUtils]: 128: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 129: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 130: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 131: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 132: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 133: Hoare triple {13996#false} ~i~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 134: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,164 INFO L273 TraceCheckUtils]: 135: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,165 INFO L273 TraceCheckUtils]: 136: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,165 INFO L273 TraceCheckUtils]: 137: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,165 INFO L273 TraceCheckUtils]: 138: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,165 INFO L273 TraceCheckUtils]: 139: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,165 INFO L273 TraceCheckUtils]: 140: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,165 INFO L273 TraceCheckUtils]: 141: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,166 INFO L273 TraceCheckUtils]: 142: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,166 INFO L273 TraceCheckUtils]: 143: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,166 INFO L273 TraceCheckUtils]: 144: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,166 INFO L273 TraceCheckUtils]: 145: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,166 INFO L273 TraceCheckUtils]: 146: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,166 INFO L273 TraceCheckUtils]: 147: Hoare triple {13996#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13996#false} is VALID [2018-11-23 12:05:36,167 INFO L273 TraceCheckUtils]: 148: Hoare triple {13996#false} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-23 12:05:36,167 INFO L273 TraceCheckUtils]: 149: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-23 12:05:36,167 INFO L273 TraceCheckUtils]: 150: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13996#false} is VALID [2018-11-23 12:05:36,167 INFO L256 TraceCheckUtils]: 151: Hoare triple {13996#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {13996#false} is VALID [2018-11-23 12:05:36,167 INFO L273 TraceCheckUtils]: 152: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-23 12:05:36,168 INFO L273 TraceCheckUtils]: 153: Hoare triple {13996#false} assume 0 == ~cond; {13996#false} is VALID [2018-11-23 12:05:36,168 INFO L273 TraceCheckUtils]: 154: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-23 12:05:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-23 12:05:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:36,206 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 155 [2018-11-23 12:05:36,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:36,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:36,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:36,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:36,268 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 18 states. [2018-11-23 12:05:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:37,902 INFO L93 Difference]: Finished difference Result 308 states and 334 transitions. [2018-11-23 12:05:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:37,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 155 [2018-11-23 12:05:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 222 transitions. [2018-11-23 12:05:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 222 transitions. [2018-11-23 12:05:37,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 222 transitions. [2018-11-23 12:05:38,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:38,159 INFO L225 Difference]: With dead ends: 308 [2018-11-23 12:05:38,160 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 12:05:38,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 12:05:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-11-23 12:05:38,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:38,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 169 states. [2018-11-23 12:05:38,276 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 169 states. [2018-11-23 12:05:38,276 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 169 states. [2018-11-23 12:05:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:38,279 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-11-23 12:05:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-11-23 12:05:38,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:38,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:38,280 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 169 states. [2018-11-23 12:05:38,280 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 169 states. [2018-11-23 12:05:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:38,282 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-11-23 12:05:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-11-23 12:05:38,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:38,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:38,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:38,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-23 12:05:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-11-23 12:05:38,285 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 155 [2018-11-23 12:05:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:38,285 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-11-23 12:05:38,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-11-23 12:05:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 12:05:38,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:38,287 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 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, 1, 1, 1, 1] [2018-11-23 12:05:38,287 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:38,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2109746362, now seen corresponding path program 15 times [2018-11-23 12:05:38,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:38,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:38,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:38,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {15717#true} call ULTIMATE.init(); {15717#true} is VALID [2018-11-23 12:05:38,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {15717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15717#true} is VALID [2018-11-23 12:05:38,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {15717#true} assume true; {15717#true} is VALID [2018-11-23 12:05:38,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15717#true} {15717#true} #152#return; {15717#true} is VALID [2018-11-23 12:05:38,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {15717#true} call #t~ret2 := main(); {15717#true} is VALID [2018-11-23 12:05:38,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {15717#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15719#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {15719#(= 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; {15720#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {15720#(<= 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; {15721#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {15721#(<= 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; {15722#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {15722#(<= 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; {15723#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {15723#(<= 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; {15724#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {15724#(<= 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; {15725#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {15725#(<= 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; {15726#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {15726#(<= 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; {15727#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {15727#(<= 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; {15728#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {15728#(<= 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; {15729#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {15729#(<= 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; {15730#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {15730#(<= 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; {15731#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {15731#(<= 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; {15732#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {15732#(<= 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; {15733#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {15733#(<= 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; {15734#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {15734#(<= main_~i~0 15)} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 43: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 56: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 58: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 60: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 68: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 69: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 70: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 75: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 82: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 85: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 86: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 91: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 92: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 93: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 94: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 95: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 98: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,708 INFO L273 TraceCheckUtils]: 99: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 100: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 101: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 102: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 103: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 104: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 105: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 106: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 107: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,709 INFO L273 TraceCheckUtils]: 108: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 109: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 110: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 111: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 112: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 113: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 114: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 115: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,710 INFO L273 TraceCheckUtils]: 116: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 117: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 118: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 119: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 120: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 121: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 122: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 123: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 124: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,711 INFO L273 TraceCheckUtils]: 125: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 126: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 127: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 128: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 129: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 130: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 131: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 132: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 133: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,712 INFO L273 TraceCheckUtils]: 134: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 135: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 136: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 137: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 138: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 139: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 140: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 141: Hoare triple {15718#false} ~i~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 142: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,713 INFO L273 TraceCheckUtils]: 143: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 144: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 145: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 146: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 147: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 148: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 149: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 150: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 151: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,714 INFO L273 TraceCheckUtils]: 152: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 153: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 154: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 155: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 156: Hoare triple {15718#false} assume !!(~i~0 < 100000);call write~int(50, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 157: Hoare triple {15718#false} assume !(~i~0 < 100000); {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 158: Hoare triple {15718#false} havoc ~x~0;~x~0 := 0; {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 159: Hoare triple {15718#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L256 TraceCheckUtils]: 160: Hoare triple {15718#false} call __VERIFIER_assert((if 50 == #t~mem1 then 1 else 0)); {15718#false} is VALID [2018-11-23 12:05:38,715 INFO L273 TraceCheckUtils]: 161: Hoare triple {15718#false} ~cond := #in~cond; {15718#false} is VALID [2018-11-23 12:05:38,716 INFO L273 TraceCheckUtils]: 162: Hoare triple {15718#false} assume 0 == ~cond; {15718#false} is VALID [2018-11-23 12:05:38,716 INFO L273 TraceCheckUtils]: 163: Hoare triple {15718#false} assume !false; {15718#false} is VALID [2018-11-23 12:05:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2018-11-23 12:05:38,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:38,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:38,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2