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_init8_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:37,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:37,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:37,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:37,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:37,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:37,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:37,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:37,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:37,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:37,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:37,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:37,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:37,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:37,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:37,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:37,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:37,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:37,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:37,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:37,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:37,903 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:37,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:37,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:37,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:37,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:37,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:37,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:37,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:37,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:37,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:37,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:37,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:37,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:37,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:37,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:37,915 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:37,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:37,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:37,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:37,932 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:37,933 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:37,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:37,934 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:37,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:37,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:37,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:37,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:37,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:37,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:37,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:37,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:37,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:37,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:37,937 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:37,937 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:37,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:37,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:37,938 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:37,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:37,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:37,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:37,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:37,939 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:37,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:37,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:37,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:37,940 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:38,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:38,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:38,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:38,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:38,032 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:38,033 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init8_true-unreach-call_ground.i [2018-11-23 12:02:38,121 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445f009c3/021f2b49789e4a2b86b7e288df77d19d/FLAG7a19f12cd [2018-11-23 12:02:38,550 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:38,550 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init8_true-unreach-call_ground.i [2018-11-23 12:02:38,556 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445f009c3/021f2b49789e4a2b86b7e288df77d19d/FLAG7a19f12cd [2018-11-23 12:02:38,928 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445f009c3/021f2b49789e4a2b86b7e288df77d19d [2018-11-23 12:02:38,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:38,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:38,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:38,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:38,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:38,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1310d4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38, skipping insertion in model container [2018-11-23 12:02:38,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:38,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:39,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:39,268 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:39,318 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:39,355 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:39,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:39 WrapperNode [2018-11-23 12:02:39,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:39,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:39,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:39,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:39,369 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:39" (1/1) ... [2018-11-23 12:02:39,381 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:39" (1/1) ... [2018-11-23 12:02:39,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:39,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:39,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:39,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:39,404 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:39" (1/1) ... [2018-11-23 12:02:39,404 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:39" (1/1) ... [2018-11-23 12:02:39,406 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:39" (1/1) ... [2018-11-23 12:02:39,406 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:39" (1/1) ... [2018-11-23 12:02:39,419 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:39" (1/1) ... [2018-11-23 12:02:39,434 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:39" (1/1) ... [2018-11-23 12:02:39,438 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:39" (1/1) ... [2018-11-23 12:02:39,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:39,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:39,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:39,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:39,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:39" (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:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:40,442 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:40,442 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:02:40,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:40 BoogieIcfgContainer [2018-11-23 12:02:40,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:40,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:40,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:40,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:40,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:38" (1/3) ... [2018-11-23 12:02:40,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dce7d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:40, skipping insertion in model container [2018-11-23 12:02:40,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:39" (2/3) ... [2018-11-23 12:02:40,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dce7d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:40, skipping insertion in model container [2018-11-23 12:02:40,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:40" (3/3) ... [2018-11-23 12:02:40,459 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init8_true-unreach-call_ground.i [2018-11-23 12:02:40,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:40,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:40,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:40,554 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:40,555 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:40,555 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:40,555 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:40,557 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:40,557 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:40,557 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:40,558 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:40,558 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 12:02:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:02:40,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:40,603 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1916738342, now seen corresponding path program 1 times [2018-11-23 12:02:40,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 12:02:40,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 12:02:40,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:02:40,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #139#return; {40#true} is VALID [2018-11-23 12:02:40,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret2 := main(); {40#true} is VALID [2018-11-23 12:02:40,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {40#true} is VALID [2018-11-23 12:02:40,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 12:02:40,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 12:02:40,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 12:02:40,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 12:02:40,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 12:02:40,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:02:40,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 12:02:40,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 12:02:40,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {41#false} havoc ~x~0;~x~0 := 0; {41#false} is VALID [2018-11-23 12:02:40,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {41#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41#false} is VALID [2018-11-23 12:02:40,789 INFO L256 TraceCheckUtils]: 23: Hoare triple {41#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {41#false} is VALID [2018-11-23 12:02:40,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-23 12:02:40,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2018-11-23 12:02:40,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 12:02:40,795 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:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:40,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:40,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 12:02:40,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:40,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:40,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:40,974 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 12:02:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,319 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2018-11-23 12:02:41,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:41,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 12:02:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2018-11-23 12:02:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2018-11-23 12:02:41,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2018-11-23 12:02:41,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,694 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:02:41,694 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:02:41,698 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:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:02:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:02:41,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:41,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:41,756 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:41,756 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,761 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-23 12:02:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:02:41,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,762 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:41,763 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,768 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-23 12:02:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:02:41,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:41,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:02:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:02:41,775 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2018-11-23 12:02:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:41,776 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:02:41,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:02:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:02:41,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:41,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:41,778 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:41,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -330794466, now seen corresponding path program 1 times [2018-11-23 12:02:41,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-23 12:02:41,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {247#true} is VALID [2018-11-23 12:02:41,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-23 12:02:41,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #139#return; {247#true} is VALID [2018-11-23 12:02:41,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2018-11-23 12:02:41,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {249#(= main_~i~0 0)} is VALID [2018-11-23 12:02:41,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {249#(= main_~i~0 0)} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 12:02:41,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {248#false} havoc ~x~0;~x~0 := 0; {248#false} is VALID [2018-11-23 12:02:41,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {248#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {248#false} is VALID [2018-11-23 12:02:41,980 INFO L256 TraceCheckUtils]: 23: Hoare triple {248#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {248#false} is VALID [2018-11-23 12:02:41,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2018-11-23 12:02:41,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {248#false} assume 0 == ~cond; {248#false} is VALID [2018-11-23 12:02:41,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-23 12:02:41,988 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:41,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:41,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:41,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:02:41,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:42,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:42,239 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2018-11-23 12:02:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,609 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2018-11-23 12:02:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:42,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:02:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 12:02:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 12:02:42,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 12:02:42,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,813 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:02:42,813 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:02:42,814 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:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:02:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:02:42,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:42,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:42,853 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:42,853 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,857 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:02:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:02:42,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,858 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:42,858 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,862 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:02:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:02:42,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:42,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:02:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 12:02:42,867 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 12:02:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:42,867 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:02:42,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:02:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:02:42,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:42,869 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] [2018-11-23 12:02:42,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:42,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1167956326, now seen corresponding path program 1 times [2018-11-23 12:02:42,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:42,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 12:02:43,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {493#true} is VALID [2018-11-23 12:02:43,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 12:02:43,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #139#return; {493#true} is VALID [2018-11-23 12:02:43,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret2 := main(); {493#true} is VALID [2018-11-23 12:02:43,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {495#(= main_~i~0 0)} is VALID [2018-11-23 12:02:43,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {495#(= 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; {496#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {494#false} havoc ~x~0;~x~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {494#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {494#false} is VALID [2018-11-23 12:02:43,150 INFO L256 TraceCheckUtils]: 31: Hoare triple {494#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {494#false} is VALID [2018-11-23 12:02:43,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 12:02:43,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 12:02:43,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 12:02:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:02:43,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:43,154 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:43,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:43,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 12:02:43,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {493#true} is VALID [2018-11-23 12:02:43,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 12:02:43,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #139#return; {493#true} is VALID [2018-11-23 12:02:43,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret2 := main(); {493#true} is VALID [2018-11-23 12:02:43,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {515#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:43,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#(<= 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; {496#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:02:43,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:02:43,553 INFO L273 TraceCheckUtils]: 29: Hoare triple {494#false} havoc ~x~0;~x~0 := 0; {494#false} is VALID [2018-11-23 12:02:43,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {494#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {494#false} is VALID [2018-11-23 12:02:43,554 INFO L256 TraceCheckUtils]: 31: Hoare triple {494#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {494#false} is VALID [2018-11-23 12:02:43,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 12:02:43,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 12:02:43,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 12:02:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:02:43,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:43,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:43,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 12:02:43,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:43,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:43,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:43,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:43,692 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-11-23 12:02:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,185 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2018-11-23 12:02:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:44,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 12:02:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 12:02:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 12:02:44,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2018-11-23 12:02:44,461 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:44,465 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:02:44,465 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:02:44,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:02:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:02:44,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:44,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:44,509 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:44,509 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,513 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 12:02:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 12:02:44,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,514 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:44,514 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,517 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 12:02:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 12:02:44,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:44,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:02:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 12:02:44,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 35 [2018-11-23 12:02:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:44,522 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 12:02:44,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 12:02:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:02:44,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:44,524 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:44,524 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:44,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1255820446, now seen corresponding path program 2 times [2018-11-23 12:02:44,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-23 12:02:44,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {905#true} is VALID [2018-11-23 12:02:44,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-23 12:02:44,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #139#return; {905#true} is VALID [2018-11-23 12:02:44,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret2 := main(); {905#true} is VALID [2018-11-23 12:02:44,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {907#(= main_~i~0 0)} is VALID [2018-11-23 12:02:44,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {907#(= 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; {908#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#(<= 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; {909#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {909#(<= main_~i~0 2)} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 12:02:44,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {906#false} havoc ~x~0;~x~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {906#false} is VALID [2018-11-23 12:02:44,684 INFO L256 TraceCheckUtils]: 39: Hoare triple {906#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {906#false} is VALID [2018-11-23 12:02:44,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {906#false} ~cond := #in~cond; {906#false} is VALID [2018-11-23 12:02:44,685 INFO L273 TraceCheckUtils]: 41: Hoare triple {906#false} assume 0 == ~cond; {906#false} is VALID [2018-11-23 12:02:44,685 INFO L273 TraceCheckUtils]: 42: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-23 12:02:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:02:44,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:44,688 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:44,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:44,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:44,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:44,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-23 12:02:44,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {905#true} is VALID [2018-11-23 12:02:44,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-23 12:02:44,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #139#return; {905#true} is VALID [2018-11-23 12:02:44,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret2 := main(); {905#true} is VALID [2018-11-23 12:02:44,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,891 INFO L273 TraceCheckUtils]: 21: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,892 INFO L273 TraceCheckUtils]: 27: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,892 INFO L273 TraceCheckUtils]: 28: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 12:02:44,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 12:02:44,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 12:02:44,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {905#true} ~i~0 := 0; {1012#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:44,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {1012#(<= 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; {908#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {908#(<= 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; {909#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {909#(<= main_~i~0 2)} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 12:02:44,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {906#false} havoc ~x~0;~x~0 := 0; {906#false} is VALID [2018-11-23 12:02:44,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {906#false} is VALID [2018-11-23 12:02:44,903 INFO L256 TraceCheckUtils]: 39: Hoare triple {906#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {906#false} is VALID [2018-11-23 12:02:44,903 INFO L273 TraceCheckUtils]: 40: Hoare triple {906#false} ~cond := #in~cond; {906#false} is VALID [2018-11-23 12:02:44,904 INFO L273 TraceCheckUtils]: 41: Hoare triple {906#false} assume 0 == ~cond; {906#false} is VALID [2018-11-23 12:02:44,904 INFO L273 TraceCheckUtils]: 42: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-23 12:02:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:02:44,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:44,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:44,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 12:02:44,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:44,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:45,076 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:02:45,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:45,078 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2018-11-23 12:02:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,415 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2018-11-23 12:02:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:45,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 12:02:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-23 12:02:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-23 12:02:45,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2018-11-23 12:02:45,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,562 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:02:45,562 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:02:45,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:02:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:02:45,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:45,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,663 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,663 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,667 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:02:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:02:45,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,669 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,669 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,672 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:02:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:02:45,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:45,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:02:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-23 12:02:45,676 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 43 [2018-11-23 12:02:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:45,677 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 12:02:45,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:02:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:02:45,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:45,679 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:45,679 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:45,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2017193242, now seen corresponding path program 3 times [2018-11-23 12:02:45,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:45,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:45,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:45,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {1404#true} call ULTIMATE.init(); {1404#true} is VALID [2018-11-23 12:02:45,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {1404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1404#true} is VALID [2018-11-23 12:02:45,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {1404#true} assume true; {1404#true} is VALID [2018-11-23 12:02:45,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1404#true} {1404#true} #139#return; {1404#true} is VALID [2018-11-23 12:02:45,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {1404#true} call #t~ret2 := main(); {1404#true} is VALID [2018-11-23 12:02:45,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {1404#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1406#(= main_~i~0 0)} is VALID [2018-11-23 12:02:45,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {1406#(= 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; {1407#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {1407#(<= 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; {1408#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {1408#(<= 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; {1409#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {1409#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,905 INFO L273 TraceCheckUtils]: 31: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,908 INFO L273 TraceCheckUtils]: 42: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,908 INFO L273 TraceCheckUtils]: 43: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:45,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:45,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {1405#false} havoc ~x~0;~x~0 := 0; {1405#false} is VALID [2018-11-23 12:02:45,909 INFO L273 TraceCheckUtils]: 46: Hoare triple {1405#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1405#false} is VALID [2018-11-23 12:02:45,909 INFO L256 TraceCheckUtils]: 47: Hoare triple {1405#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {1405#false} is VALID [2018-11-23 12:02:45,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {1405#false} ~cond := #in~cond; {1405#false} is VALID [2018-11-23 12:02:45,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {1405#false} assume 0 == ~cond; {1405#false} is VALID [2018-11-23 12:02:45,910 INFO L273 TraceCheckUtils]: 50: Hoare triple {1405#false} assume !false; {1405#false} is VALID [2018-11-23 12:02:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 12:02:45,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:45,914 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:45,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:46,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:46,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:46,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {1404#true} call ULTIMATE.init(); {1404#true} is VALID [2018-11-23 12:02:46,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {1404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1404#true} is VALID [2018-11-23 12:02:46,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {1404#true} assume true; {1404#true} is VALID [2018-11-23 12:02:46,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1404#true} {1404#true} #139#return; {1404#true} is VALID [2018-11-23 12:02:46,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {1404#true} call #t~ret2 := main(); {1404#true} is VALID [2018-11-23 12:02:46,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {1404#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1404#true} is VALID [2018-11-23 12:02:46,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 12:02:46,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 12:02:46,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 12:02:46,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 12:02:46,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 12:02:46,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 12:02:46,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 12:02:46,193 INFO L273 TraceCheckUtils]: 25: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 12:02:46,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 12:02:46,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 12:02:46,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {1404#true} ~i~0 := 0; {1503#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:46,197 INFO L273 TraceCheckUtils]: 31: Hoare triple {1503#(<= 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; {1407#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {1407#(<= 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; {1408#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {1408#(<= 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; {1409#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {1409#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:46,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:46,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:46,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:46,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:46,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:46,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 12:02:46,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:46,200 INFO L273 TraceCheckUtils]: 42: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:46,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 12:02:46,201 INFO L273 TraceCheckUtils]: 44: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 12:02:46,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {1405#false} havoc ~x~0;~x~0 := 0; {1405#false} is VALID [2018-11-23 12:02:46,201 INFO L273 TraceCheckUtils]: 46: Hoare triple {1405#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1405#false} is VALID [2018-11-23 12:02:46,202 INFO L256 TraceCheckUtils]: 47: Hoare triple {1405#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {1405#false} is VALID [2018-11-23 12:02:46,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {1405#false} ~cond := #in~cond; {1405#false} is VALID [2018-11-23 12:02:46,203 INFO L273 TraceCheckUtils]: 49: Hoare triple {1405#false} assume 0 == ~cond; {1405#false} is VALID [2018-11-23 12:02:46,203 INFO L273 TraceCheckUtils]: 50: Hoare triple {1405#false} assume !false; {1405#false} is VALID [2018-11-23 12:02:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 12:02:46,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:46,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:46,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 12:02:46,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:46,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:46,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:46,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:46,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:46,300 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 7 states. [2018-11-23 12:02:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,821 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2018-11-23 12:02:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:46,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 12:02:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-23 12:02:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-23 12:02:46,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2018-11-23 12:02:47,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:47,105 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:02:47,105 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:02:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 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:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:02:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 12:02:47,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:47,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:47,257 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:47,257 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,260 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 12:02:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 12:02:47,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,261 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:47,261 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,264 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 12:02:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 12:02:47,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:47,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:02:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-23 12:02:47,269 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 51 [2018-11-23 12:02:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:47,269 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-23 12:02:47,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 12:02:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:02:47,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:47,271 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:47,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:47,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash 544374558, now seen corresponding path program 4 times [2018-11-23 12:02:47,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:47,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:47,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:47,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1990#true} is VALID [2018-11-23 12:02:47,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {1990#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1990#true} is VALID [2018-11-23 12:02:47,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {1990#true} assume true; {1990#true} is VALID [2018-11-23 12:02:47,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1990#true} {1990#true} #139#return; {1990#true} is VALID [2018-11-23 12:02:47,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {1990#true} call #t~ret2 := main(); {1990#true} is VALID [2018-11-23 12:02:47,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1990#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1992#(= main_~i~0 0)} is VALID [2018-11-23 12:02:47,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {1992#(= 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; {1993#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:47,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#(<= 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; {1994#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:47,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {1994#(<= 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; {1995#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:47,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {1995#(<= 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; {1996#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:47,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,490 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 35: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,492 INFO L273 TraceCheckUtils]: 40: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,492 INFO L273 TraceCheckUtils]: 42: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,493 INFO L273 TraceCheckUtils]: 44: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,493 INFO L273 TraceCheckUtils]: 45: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,494 INFO L273 TraceCheckUtils]: 48: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,494 INFO L273 TraceCheckUtils]: 49: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,495 INFO L273 TraceCheckUtils]: 51: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {1991#false} havoc ~x~0;~x~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,495 INFO L273 TraceCheckUtils]: 54: Hoare triple {1991#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1991#false} is VALID [2018-11-23 12:02:47,496 INFO L256 TraceCheckUtils]: 55: Hoare triple {1991#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {1991#false} is VALID [2018-11-23 12:02:47,496 INFO L273 TraceCheckUtils]: 56: Hoare triple {1991#false} ~cond := #in~cond; {1991#false} is VALID [2018-11-23 12:02:47,496 INFO L273 TraceCheckUtils]: 57: Hoare triple {1991#false} assume 0 == ~cond; {1991#false} is VALID [2018-11-23 12:02:47,496 INFO L273 TraceCheckUtils]: 58: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2018-11-23 12:02:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 12:02:47,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:47,501 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:47,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:47,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:47,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:47,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1990#true} is VALID [2018-11-23 12:02:47,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {1990#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1990#true} is VALID [2018-11-23 12:02:47,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {1990#true} assume true; {1990#true} is VALID [2018-11-23 12:02:47,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1990#true} {1990#true} #139#return; {1990#true} is VALID [2018-11-23 12:02:47,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {1990#true} call #t~ret2 := main(); {1990#true} is VALID [2018-11-23 12:02:47,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {1990#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2015#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:47,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {2015#(<= 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; {1993#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:47,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#(<= 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; {1994#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:47,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {1994#(<= 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; {1995#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:47,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {1995#(<= 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; {1996#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:47,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,832 INFO L273 TraceCheckUtils]: 31: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,832 INFO L273 TraceCheckUtils]: 32: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,835 INFO L273 TraceCheckUtils]: 44: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,835 INFO L273 TraceCheckUtils]: 45: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,836 INFO L273 TraceCheckUtils]: 50: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,836 INFO L273 TraceCheckUtils]: 51: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 12:02:47,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 12:02:47,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {1991#false} havoc ~x~0;~x~0 := 0; {1991#false} is VALID [2018-11-23 12:02:47,837 INFO L273 TraceCheckUtils]: 54: Hoare triple {1991#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1991#false} is VALID [2018-11-23 12:02:47,837 INFO L256 TraceCheckUtils]: 55: Hoare triple {1991#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {1991#false} is VALID [2018-11-23 12:02:47,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {1991#false} ~cond := #in~cond; {1991#false} is VALID [2018-11-23 12:02:47,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {1991#false} assume 0 == ~cond; {1991#false} is VALID [2018-11-23 12:02:47,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2018-11-23 12:02:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 12:02:47,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:47,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 12:02:47,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:47,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:47,926 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:47,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:47,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:47,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:47,928 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 8 states. [2018-11-23 12:02:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,762 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2018-11-23 12:02:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:48,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 12:02:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 12:02:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 12:02:48,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-23 12:02:48,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:48,897 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:02:48,897 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:02:48,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:02:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 12:02:48,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:48,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 12:02:48,947 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:02:48,948 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:02:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,951 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-23 12:02:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 12:02:48,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:48,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:48,952 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:02:48,952 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:02:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,954 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-23 12:02:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 12:02:48,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:48,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:48,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:48,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:02:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-23 12:02:48,958 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 59 [2018-11-23 12:02:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:48,958 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-23 12:02:48,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 12:02:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:02:48,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:48,959 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:48,960 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:48,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash 325227418, now seen corresponding path program 5 times [2018-11-23 12:02:48,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:48,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:48,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:48,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:49,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {2663#true} call ULTIMATE.init(); {2663#true} is VALID [2018-11-23 12:02:49,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {2663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2663#true} is VALID [2018-11-23 12:02:49,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {2663#true} assume true; {2663#true} is VALID [2018-11-23 12:02:49,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2663#true} {2663#true} #139#return; {2663#true} is VALID [2018-11-23 12:02:49,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {2663#true} call #t~ret2 := main(); {2663#true} is VALID [2018-11-23 12:02:49,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {2663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2665#(= main_~i~0 0)} is VALID [2018-11-23 12:02:49,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {2665#(= 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; {2666#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:49,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {2666#(<= 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; {2667#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:49,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {2667#(<= 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; {2668#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:49,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {2668#(<= 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; {2669#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:49,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {2669#(<= 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; {2670#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:49,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {2670#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 30: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,282 INFO L273 TraceCheckUtils]: 32: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 34: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 35: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 38: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 40: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 44: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 45: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,284 INFO L273 TraceCheckUtils]: 46: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 47: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 48: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 50: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 51: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 52: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,285 INFO L273 TraceCheckUtils]: 53: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 54: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 55: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 56: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 57: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 59: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 60: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:02:49,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {2664#false} havoc ~x~0;~x~0 := 0; {2664#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 62: Hoare triple {2664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2664#false} is VALID [2018-11-23 12:02:49,287 INFO L256 TraceCheckUtils]: 63: Hoare triple {2664#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {2664#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 64: Hoare triple {2664#false} ~cond := #in~cond; {2664#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 65: Hoare triple {2664#false} assume 0 == ~cond; {2664#false} is VALID [2018-11-23 12:02:49,287 INFO L273 TraceCheckUtils]: 66: Hoare triple {2664#false} assume !false; {2664#false} is VALID [2018-11-23 12:02:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:02:49,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:49,290 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:49,299 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:05,534 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:03:05,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:05,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {2663#true} call ULTIMATE.init(); {2663#true} is VALID [2018-11-23 12:03:05,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {2663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2663#true} is VALID [2018-11-23 12:03:05,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {2663#true} assume true; {2663#true} is VALID [2018-11-23 12:03:05,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2663#true} {2663#true} #139#return; {2663#true} is VALID [2018-11-23 12:03:05,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {2663#true} call #t~ret2 := main(); {2663#true} is VALID [2018-11-23 12:03:05,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {2663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2663#true} is VALID [2018-11-23 12:03:05,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 12:03:05,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {2663#true} ~i~0 := 0; {2663#true} is VALID [2018-11-23 12:03:05,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,775 INFO L273 TraceCheckUtils]: 18: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 12:03:05,775 INFO L273 TraceCheckUtils]: 19: Hoare triple {2663#true} ~i~0 := 0; {2663#true} is VALID [2018-11-23 12:03:05,775 INFO L273 TraceCheckUtils]: 20: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 12:03:05,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {2663#true} ~i~0 := 0; {2663#true} is VALID [2018-11-23 12:03:05,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 12:03:05,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 12:03:05,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {2663#true} ~i~0 := 0; {2773#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:05,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {2773#(<= 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; {2666#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:05,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {2666#(<= 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; {2667#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:05,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {2667#(<= 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; {2668#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:05,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {2668#(<= 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; {2669#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:05,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {2669#(<= 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; {2670#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:05,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {2670#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:03:05,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:03:05,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 52: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 58: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 60: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 61: Hoare triple {2664#false} havoc ~x~0;~x~0 := 0; {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 62: Hoare triple {2664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L256 TraceCheckUtils]: 63: Hoare triple {2664#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {2664#false} ~cond := #in~cond; {2664#false} is VALID [2018-11-23 12:03:05,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {2664#false} assume 0 == ~cond; {2664#false} is VALID [2018-11-23 12:03:05,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {2664#false} assume !false; {2664#false} is VALID [2018-11-23 12:03:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:03:05,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:05,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:03:05,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 12:03:05,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:05,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:03:05,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:05,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:03:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:03:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:03:05,901 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2018-11-23 12:03:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,673 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2018-11-23 12:03:06,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:03:06,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 12:03:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:03:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-23 12:03:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:03:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-23 12:03:06,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 128 transitions. [2018-11-23 12:03:06,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:06,836 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:03:06,836 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:03:06,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 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:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:03:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 12:03:06,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:06,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:06,889 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:06,889 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,892 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:03:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 12:03:06,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:06,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:06,893 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:06,893 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,896 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:03:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 12:03:06,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:06,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:06,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:06,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:03:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 12:03:06,901 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 67 [2018-11-23 12:03:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:06,901 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 12:03:06,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:03:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 12:03:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:03:06,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:06,902 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:06,903 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:06,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1206981022, now seen corresponding path program 6 times [2018-11-23 12:03:06,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:06,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:06,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:06,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:06,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:07,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {3423#true} call ULTIMATE.init(); {3423#true} is VALID [2018-11-23 12:03:07,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {3423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3423#true} is VALID [2018-11-23 12:03:07,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {3423#true} assume true; {3423#true} is VALID [2018-11-23 12:03:07,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3423#true} {3423#true} #139#return; {3423#true} is VALID [2018-11-23 12:03:07,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {3423#true} call #t~ret2 := main(); {3423#true} is VALID [2018-11-23 12:03:07,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {3423#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3425#(= main_~i~0 0)} is VALID [2018-11-23 12:03:07,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {3425#(= 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; {3426#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:07,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {3426#(<= 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; {3427#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:07,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {3427#(<= 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; {3428#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:07,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {3428#(<= 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; {3429#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:07,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {3429#(<= 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; {3430#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:07,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {3430#(<= 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; {3431#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:07,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {3431#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 34: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,168 INFO L273 TraceCheckUtils]: 45: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,168 INFO L273 TraceCheckUtils]: 48: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,169 INFO L273 TraceCheckUtils]: 50: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,169 INFO L273 TraceCheckUtils]: 52: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,169 INFO L273 TraceCheckUtils]: 54: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,170 INFO L273 TraceCheckUtils]: 55: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,170 INFO L273 TraceCheckUtils]: 56: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,170 INFO L273 TraceCheckUtils]: 57: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,170 INFO L273 TraceCheckUtils]: 58: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,170 INFO L273 TraceCheckUtils]: 59: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,170 INFO L273 TraceCheckUtils]: 60: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,171 INFO L273 TraceCheckUtils]: 61: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,171 INFO L273 TraceCheckUtils]: 62: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,171 INFO L273 TraceCheckUtils]: 63: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,171 INFO L273 TraceCheckUtils]: 64: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,171 INFO L273 TraceCheckUtils]: 65: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,172 INFO L273 TraceCheckUtils]: 67: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:07,172 INFO L273 TraceCheckUtils]: 68: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:07,172 INFO L273 TraceCheckUtils]: 69: Hoare triple {3424#false} havoc ~x~0;~x~0 := 0; {3424#false} is VALID [2018-11-23 12:03:07,172 INFO L273 TraceCheckUtils]: 70: Hoare triple {3424#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3424#false} is VALID [2018-11-23 12:03:07,172 INFO L256 TraceCheckUtils]: 71: Hoare triple {3424#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {3424#false} is VALID [2018-11-23 12:03:07,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {3424#false} ~cond := #in~cond; {3424#false} is VALID [2018-11-23 12:03:07,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {3424#false} assume 0 == ~cond; {3424#false} is VALID [2018-11-23 12:03:07,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {3424#false} assume !false; {3424#false} is VALID [2018-11-23 12:03:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 12:03:07,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:07,176 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:07,185 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:14,793 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:03:14,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:14,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:14,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {3423#true} call ULTIMATE.init(); {3423#true} is VALID [2018-11-23 12:03:14,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {3423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3423#true} is VALID [2018-11-23 12:03:14,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {3423#true} assume true; {3423#true} is VALID [2018-11-23 12:03:14,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3423#true} {3423#true} #139#return; {3423#true} is VALID [2018-11-23 12:03:14,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {3423#true} call #t~ret2 := main(); {3423#true} is VALID [2018-11-23 12:03:14,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {3423#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3450#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:14,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {3450#(<= 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; {3426#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:14,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {3426#(<= 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; {3427#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:14,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {3427#(<= 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; {3428#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:14,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {3428#(<= 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; {3429#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:14,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {3429#(<= 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; {3430#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:14,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {3430#(<= 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; {3431#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:14,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {3431#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:14,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:14,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:14,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:14,998 INFO L273 TraceCheckUtils]: 22: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:14,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:15,000 INFO L273 TraceCheckUtils]: 29: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:15,000 INFO L273 TraceCheckUtils]: 30: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,001 INFO L273 TraceCheckUtils]: 35: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:15,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:15,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,001 INFO L273 TraceCheckUtils]: 39: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,002 INFO L273 TraceCheckUtils]: 44: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:15,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:15,003 INFO L273 TraceCheckUtils]: 46: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,003 INFO L273 TraceCheckUtils]: 48: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:15,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:15,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,004 INFO L273 TraceCheckUtils]: 55: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,005 INFO L273 TraceCheckUtils]: 59: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,005 INFO L273 TraceCheckUtils]: 60: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:15,005 INFO L273 TraceCheckUtils]: 61: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 12:03:15,006 INFO L273 TraceCheckUtils]: 62: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,006 INFO L273 TraceCheckUtils]: 63: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,006 INFO L273 TraceCheckUtils]: 64: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,006 INFO L273 TraceCheckUtils]: 65: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,006 INFO L273 TraceCheckUtils]: 67: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 12:03:15,007 INFO L273 TraceCheckUtils]: 68: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 12:03:15,007 INFO L273 TraceCheckUtils]: 69: Hoare triple {3424#false} havoc ~x~0;~x~0 := 0; {3424#false} is VALID [2018-11-23 12:03:15,007 INFO L273 TraceCheckUtils]: 70: Hoare triple {3424#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3424#false} is VALID [2018-11-23 12:03:15,007 INFO L256 TraceCheckUtils]: 71: Hoare triple {3424#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {3424#false} is VALID [2018-11-23 12:03:15,007 INFO L273 TraceCheckUtils]: 72: Hoare triple {3424#false} ~cond := #in~cond; {3424#false} is VALID [2018-11-23 12:03:15,007 INFO L273 TraceCheckUtils]: 73: Hoare triple {3424#false} assume 0 == ~cond; {3424#false} is VALID [2018-11-23 12:03:15,008 INFO L273 TraceCheckUtils]: 74: Hoare triple {3424#false} assume !false; {3424#false} is VALID [2018-11-23 12:03:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 12:03:15,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:15,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:03:15,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-23 12:03:15,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:15,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:03:15,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:15,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:03:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:03:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:03:15,079 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 10 states. [2018-11-23 12:03:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,645 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2018-11-23 12:03:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:03:15,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-23 12:03:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:03:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2018-11-23 12:03:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:03:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2018-11-23 12:03:15,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 136 transitions. [2018-11-23 12:03:15,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:15,808 INFO L225 Difference]: With dead ends: 155 [2018-11-23 12:03:15,808 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:03:15,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:03:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:03:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 12:03:15,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:15,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:15,862 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:15,863 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,865 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-23 12:03:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 12:03:15,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,866 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:15,866 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,868 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-23 12:03:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 12:03:15,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:15,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:03:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-11-23 12:03:15,872 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 75 [2018-11-23 12:03:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:15,872 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-23 12:03:15,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:03:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 12:03:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:03:15,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:15,873 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:15,873 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:15,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash 192305690, now seen corresponding path program 7 times [2018-11-23 12:03:15,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:15,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:15,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:15,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {4270#true} call ULTIMATE.init(); {4270#true} is VALID [2018-11-23 12:03:16,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {4270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4270#true} is VALID [2018-11-23 12:03:16,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {4270#true} assume true; {4270#true} is VALID [2018-11-23 12:03:16,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4270#true} {4270#true} #139#return; {4270#true} is VALID [2018-11-23 12:03:16,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {4270#true} call #t~ret2 := main(); {4270#true} is VALID [2018-11-23 12:03:16,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {4270#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4272#(= main_~i~0 0)} is VALID [2018-11-23 12:03:16,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {4272#(= 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; {4273#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:16,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {4273#(<= 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; {4274#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:16,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {4274#(<= 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; {4275#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:16,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {4275#(<= 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; {4276#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:16,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {4276#(<= 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; {4277#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:16,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {4277#(<= 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; {4278#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:16,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {4278#(<= 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; {4279#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:16,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 32: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 34: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 37: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 42: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 61: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 66: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 67: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 68: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 69: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 70: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 71: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,303 INFO L273 TraceCheckUtils]: 72: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 73: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 74: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 75: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 76: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 77: Hoare triple {4271#false} havoc ~x~0;~x~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 78: Hoare triple {4271#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L256 TraceCheckUtils]: 79: Hoare triple {4271#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {4271#false} is VALID [2018-11-23 12:03:16,304 INFO L273 TraceCheckUtils]: 80: Hoare triple {4271#false} ~cond := #in~cond; {4271#false} is VALID [2018-11-23 12:03:16,305 INFO L273 TraceCheckUtils]: 81: Hoare triple {4271#false} assume 0 == ~cond; {4271#false} is VALID [2018-11-23 12:03:16,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {4271#false} assume !false; {4271#false} is VALID [2018-11-23 12:03:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:03:16,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:16,310 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:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:16,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {4270#true} call ULTIMATE.init(); {4270#true} is VALID [2018-11-23 12:03:16,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {4270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4270#true} is VALID [2018-11-23 12:03:16,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {4270#true} assume true; {4270#true} is VALID [2018-11-23 12:03:16,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4270#true} {4270#true} #139#return; {4270#true} is VALID [2018-11-23 12:03:16,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {4270#true} call #t~ret2 := main(); {4270#true} is VALID [2018-11-23 12:03:16,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {4270#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4298#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:16,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {4298#(<= 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; {4273#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:16,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {4273#(<= 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; {4274#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:16,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {4274#(<= 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; {4275#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:16,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {4275#(<= 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; {4276#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:16,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {4276#(<= 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; {4277#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:16,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {4277#(<= 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; {4278#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:16,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {4278#(<= 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; {4279#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:16,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,597 INFO L273 TraceCheckUtils]: 38: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 50: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,599 INFO L273 TraceCheckUtils]: 51: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 52: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 53: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 54: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 55: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 56: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,601 INFO L273 TraceCheckUtils]: 60: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,601 INFO L273 TraceCheckUtils]: 61: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,601 INFO L273 TraceCheckUtils]: 62: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,601 INFO L273 TraceCheckUtils]: 63: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,601 INFO L273 TraceCheckUtils]: 64: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,602 INFO L273 TraceCheckUtils]: 65: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,602 INFO L273 TraceCheckUtils]: 66: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,602 INFO L273 TraceCheckUtils]: 67: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,602 INFO L273 TraceCheckUtils]: 68: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,602 INFO L273 TraceCheckUtils]: 69: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,602 INFO L273 TraceCheckUtils]: 70: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 71: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 72: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 73: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 74: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 75: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 76: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 12:03:16,603 INFO L273 TraceCheckUtils]: 77: Hoare triple {4271#false} havoc ~x~0;~x~0 := 0; {4271#false} is VALID [2018-11-23 12:03:16,604 INFO L273 TraceCheckUtils]: 78: Hoare triple {4271#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4271#false} is VALID [2018-11-23 12:03:16,604 INFO L256 TraceCheckUtils]: 79: Hoare triple {4271#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {4271#false} is VALID [2018-11-23 12:03:16,604 INFO L273 TraceCheckUtils]: 80: Hoare triple {4271#false} ~cond := #in~cond; {4271#false} is VALID [2018-11-23 12:03:16,604 INFO L273 TraceCheckUtils]: 81: Hoare triple {4271#false} assume 0 == ~cond; {4271#false} is VALID [2018-11-23 12:03:16,604 INFO L273 TraceCheckUtils]: 82: Hoare triple {4271#false} assume !false; {4271#false} is VALID [2018-11-23 12:03:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:03:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:03:16,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 12:03:16,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:16,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:03:16,674 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:03:16,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:03:16,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:03:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:03:16,675 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 11 states. [2018-11-23 12:03:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,359 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2018-11-23 12:03:17,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:03:17,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 12:03:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:03:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2018-11-23 12:03:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:03:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2018-11-23 12:03:17,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 144 transitions. [2018-11-23 12:03:17,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:17,550 INFO L225 Difference]: With dead ends: 170 [2018-11-23 12:03:17,551 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:03:17,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 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:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:03:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 12:03:17,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:17,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 12:03:17,637 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:03:17,637 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:03:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,641 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-23 12:03:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 12:03:17,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:17,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:17,641 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:03:17,642 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:03:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,644 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-23 12:03:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 12:03:17,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:17,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:17,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:17,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:03:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-23 12:03:17,648 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 83 [2018-11-23 12:03:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:17,649 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-23 12:03:17,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:03:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 12:03:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:03:17,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:17,650 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:17,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:17,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1640627170, now seen corresponding path program 8 times [2018-11-23 12:03:17,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:17,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {5204#true} call ULTIMATE.init(); {5204#true} is VALID [2018-11-23 12:03:18,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {5204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5204#true} is VALID [2018-11-23 12:03:18,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {5204#true} assume true; {5204#true} is VALID [2018-11-23 12:03:18,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5204#true} {5204#true} #139#return; {5204#true} is VALID [2018-11-23 12:03:18,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {5204#true} call #t~ret2 := main(); {5204#true} is VALID [2018-11-23 12:03:18,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {5204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5206#(= main_~i~0 0)} is VALID [2018-11-23 12:03:18,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {5206#(= 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; {5207#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {5207#(<= 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; {5208#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {5208#(<= 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; {5209#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {5209#(<= 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; {5210#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {5210#(<= 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; {5211#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {5211#(<= 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; {5212#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {5212#(<= 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; {5213#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {5213#(<= 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; {5214#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {5214#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,411 INFO L273 TraceCheckUtils]: 23: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 53: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 55: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,416 INFO L273 TraceCheckUtils]: 56: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 61: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,417 INFO L273 TraceCheckUtils]: 65: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 68: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 70: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 71: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 72: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,418 INFO L273 TraceCheckUtils]: 73: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,419 INFO L273 TraceCheckUtils]: 74: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,419 INFO L273 TraceCheckUtils]: 75: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,419 INFO L273 TraceCheckUtils]: 76: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,419 INFO L273 TraceCheckUtils]: 77: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,419 INFO L273 TraceCheckUtils]: 78: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,419 INFO L273 TraceCheckUtils]: 79: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,420 INFO L273 TraceCheckUtils]: 80: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,420 INFO L273 TraceCheckUtils]: 81: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,420 INFO L273 TraceCheckUtils]: 82: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,420 INFO L273 TraceCheckUtils]: 83: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,420 INFO L273 TraceCheckUtils]: 84: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,420 INFO L273 TraceCheckUtils]: 85: Hoare triple {5205#false} havoc ~x~0;~x~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,421 INFO L273 TraceCheckUtils]: 86: Hoare triple {5205#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5205#false} is VALID [2018-11-23 12:03:18,421 INFO L256 TraceCheckUtils]: 87: Hoare triple {5205#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {5205#false} is VALID [2018-11-23 12:03:18,421 INFO L273 TraceCheckUtils]: 88: Hoare triple {5205#false} ~cond := #in~cond; {5205#false} is VALID [2018-11-23 12:03:18,421 INFO L273 TraceCheckUtils]: 89: Hoare triple {5205#false} assume 0 == ~cond; {5205#false} is VALID [2018-11-23 12:03:18,421 INFO L273 TraceCheckUtils]: 90: Hoare triple {5205#false} assume !false; {5205#false} is VALID [2018-11-23 12:03:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-23 12:03:18,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:18,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:18,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:18,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:18,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {5204#true} call ULTIMATE.init(); {5204#true} is VALID [2018-11-23 12:03:18,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {5204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5204#true} is VALID [2018-11-23 12:03:18,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {5204#true} assume true; {5204#true} is VALID [2018-11-23 12:03:18,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5204#true} {5204#true} #139#return; {5204#true} is VALID [2018-11-23 12:03:18,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {5204#true} call #t~ret2 := main(); {5204#true} is VALID [2018-11-23 12:03:18,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {5204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5233#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:18,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {5233#(<= 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; {5207#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {5207#(<= 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; {5208#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {5208#(<= 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; {5209#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {5209#(<= 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; {5210#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {5210#(<= 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; {5211#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {5211#(<= 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; {5212#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {5212#(<= 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; {5213#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {5213#(<= 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; {5214#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {5214#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,677 INFO L273 TraceCheckUtils]: 21: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,679 INFO L273 TraceCheckUtils]: 31: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,679 INFO L273 TraceCheckUtils]: 32: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,680 INFO L273 TraceCheckUtils]: 37: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,680 INFO L273 TraceCheckUtils]: 38: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 41: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 42: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 43: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 47: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 50: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 51: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 52: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 53: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 54: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 55: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 56: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,682 INFO L273 TraceCheckUtils]: 57: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 58: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 59: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 60: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 61: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 62: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 63: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 64: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,683 INFO L273 TraceCheckUtils]: 65: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 66: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 67: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 70: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 71: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 72: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,684 INFO L273 TraceCheckUtils]: 73: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 74: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 75: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 76: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 77: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 78: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 79: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 80: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 81: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,685 INFO L273 TraceCheckUtils]: 82: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 83: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 84: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 85: Hoare triple {5205#false} havoc ~x~0;~x~0 := 0; {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 86: Hoare triple {5205#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L256 TraceCheckUtils]: 87: Hoare triple {5205#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 88: Hoare triple {5205#false} ~cond := #in~cond; {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 89: Hoare triple {5205#false} assume 0 == ~cond; {5205#false} is VALID [2018-11-23 12:03:18,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {5205#false} assume !false; {5205#false} is VALID [2018-11-23 12:03:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-23 12:03:18,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:18,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:03:18,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-23 12:03:18,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:18,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:03:18,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:18,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:03:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:03:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:03:18,747 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 12 states. [2018-11-23 12:03:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,617 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2018-11-23 12:03:19,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:03:19,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-23 12:03:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:03:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-23 12:03:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:03:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-23 12:03:19,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 152 transitions. [2018-11-23 12:03:19,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:19,772 INFO L225 Difference]: With dead ends: 185 [2018-11-23 12:03:19,772 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:03:19,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:03:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:03:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 12:03:19,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:19,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 104 states. [2018-11-23 12:03:19,842 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 12:03:19,842 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 12:03:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,845 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:03:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 12:03:19,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:19,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:19,846 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 12:03:19,846 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 12:03:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,849 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:03:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 12:03:19,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:19,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:19,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:19,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:03:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-11-23 12:03:19,852 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 91 [2018-11-23 12:03:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:19,852 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-23 12:03:19,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:03:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 12:03:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 12:03:19,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:19,853 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:19,854 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:19,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash -32030566, now seen corresponding path program 9 times [2018-11-23 12:03:19,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:19,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:19,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:20,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {6225#true} call ULTIMATE.init(); {6225#true} is VALID [2018-11-23 12:03:20,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {6225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6225#true} is VALID [2018-11-23 12:03:20,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {6225#true} assume true; {6225#true} is VALID [2018-11-23 12:03:20,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6225#true} {6225#true} #139#return; {6225#true} is VALID [2018-11-23 12:03:20,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {6225#true} call #t~ret2 := main(); {6225#true} is VALID [2018-11-23 12:03:20,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {6225#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6227#(= main_~i~0 0)} is VALID [2018-11-23 12:03:20,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {6227#(= 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; {6228#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:20,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {6228#(<= 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; {6229#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:20,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {6229#(<= 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; {6230#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:20,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {6230#(<= 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; {6231#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:20,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {6231#(<= 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; {6232#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:20,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {6232#(<= 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; {6233#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:20,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {6233#(<= 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; {6234#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:20,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {6234#(<= 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; {6235#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:20,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {6235#(<= 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; {6236#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:20,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {6236#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 46: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 48: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 49: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 51: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 53: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 56: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 57: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 58: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,129 INFO L273 TraceCheckUtils]: 65: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,129 INFO L273 TraceCheckUtils]: 66: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,129 INFO L273 TraceCheckUtils]: 67: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,130 INFO L273 TraceCheckUtils]: 70: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,130 INFO L273 TraceCheckUtils]: 71: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,130 INFO L273 TraceCheckUtils]: 72: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,130 INFO L273 TraceCheckUtils]: 73: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,130 INFO L273 TraceCheckUtils]: 74: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,131 INFO L273 TraceCheckUtils]: 78: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,131 INFO L273 TraceCheckUtils]: 79: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,131 INFO L273 TraceCheckUtils]: 80: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,132 INFO L273 TraceCheckUtils]: 85: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,132 INFO L273 TraceCheckUtils]: 86: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,133 INFO L273 TraceCheckUtils]: 87: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,133 INFO L273 TraceCheckUtils]: 88: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,133 INFO L273 TraceCheckUtils]: 91: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:20,134 INFO L273 TraceCheckUtils]: 92: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:20,134 INFO L273 TraceCheckUtils]: 93: Hoare triple {6226#false} havoc ~x~0;~x~0 := 0; {6226#false} is VALID [2018-11-23 12:03:20,134 INFO L273 TraceCheckUtils]: 94: Hoare triple {6226#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6226#false} is VALID [2018-11-23 12:03:20,134 INFO L256 TraceCheckUtils]: 95: Hoare triple {6226#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {6226#false} is VALID [2018-11-23 12:03:20,134 INFO L273 TraceCheckUtils]: 96: Hoare triple {6226#false} ~cond := #in~cond; {6226#false} is VALID [2018-11-23 12:03:20,134 INFO L273 TraceCheckUtils]: 97: Hoare triple {6226#false} assume 0 == ~cond; {6226#false} is VALID [2018-11-23 12:03:20,135 INFO L273 TraceCheckUtils]: 98: Hoare triple {6226#false} assume !false; {6226#false} is VALID [2018-11-23 12:03:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 12:03:20,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:20,140 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:20,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:40,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:03:40,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:40,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:40,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {6225#true} call ULTIMATE.init(); {6225#true} is VALID [2018-11-23 12:03:40,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {6225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6225#true} is VALID [2018-11-23 12:03:40,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {6225#true} assume true; {6225#true} is VALID [2018-11-23 12:03:40,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6225#true} {6225#true} #139#return; {6225#true} is VALID [2018-11-23 12:03:40,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {6225#true} call #t~ret2 := main(); {6225#true} is VALID [2018-11-23 12:03:40,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {6225#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6225#true} is VALID [2018-11-23 12:03:40,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {6225#true} assume !(~i~0 < 100000); {6225#true} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {6225#true} ~i~0 := 0; {6225#true} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 12:03:40,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {6225#true} assume !(~i~0 < 100000); {6225#true} is VALID [2018-11-23 12:03:40,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {6225#true} ~i~0 := 0; {6321#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:40,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {6321#(<= 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; {6228#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:40,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {6228#(<= 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; {6229#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:40,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {6229#(<= 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; {6230#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:40,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {6230#(<= 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; {6231#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:40,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {6231#(<= 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; {6232#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:40,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {6232#(<= 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; {6233#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:40,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {6233#(<= 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; {6234#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:40,310 INFO L273 TraceCheckUtils]: 35: Hoare triple {6234#(<= 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; {6235#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:40,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {6235#(<= 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; {6236#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:40,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {6236#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:40,312 INFO L273 TraceCheckUtils]: 38: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:40,312 INFO L273 TraceCheckUtils]: 39: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,312 INFO L273 TraceCheckUtils]: 40: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,314 INFO L273 TraceCheckUtils]: 48: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:40,314 INFO L273 TraceCheckUtils]: 49: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:40,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,314 INFO L273 TraceCheckUtils]: 51: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,315 INFO L273 TraceCheckUtils]: 52: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,315 INFO L273 TraceCheckUtils]: 53: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,315 INFO L273 TraceCheckUtils]: 54: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,315 INFO L273 TraceCheckUtils]: 55: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,315 INFO L273 TraceCheckUtils]: 57: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 59: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 60: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 61: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 62: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 63: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 64: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,316 INFO L273 TraceCheckUtils]: 65: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 66: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 67: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 68: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 69: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 70: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 72: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,317 INFO L273 TraceCheckUtils]: 73: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 75: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 76: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 77: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 78: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 79: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 80: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:40,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 83: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 84: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 85: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 86: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 87: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 88: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 89: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,319 INFO L273 TraceCheckUtils]: 90: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 91: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 92: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 93: Hoare triple {6226#false} havoc ~x~0;~x~0 := 0; {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 94: Hoare triple {6226#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L256 TraceCheckUtils]: 95: Hoare triple {6226#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 96: Hoare triple {6226#false} ~cond := #in~cond; {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 97: Hoare triple {6226#false} assume 0 == ~cond; {6226#false} is VALID [2018-11-23 12:03:40,320 INFO L273 TraceCheckUtils]: 98: Hoare triple {6226#false} assume !false; {6226#false} is VALID [2018-11-23 12:03:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 12:03:40,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:40,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:03:40,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-23 12:03:40,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:40,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:03:40,413 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:03:40,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:03:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:03:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:40,414 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 13 states. [2018-11-23 12:03:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:42,054 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2018-11-23 12:03:42,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:03:42,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-23 12:03:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2018-11-23 12:03:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2018-11-23 12:03:42,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 160 transitions. [2018-11-23 12:03:42,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:42,337 INFO L225 Difference]: With dead ends: 200 [2018-11-23 12:03:42,337 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 12:03:42,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 12:03:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 12:03:42,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:42,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 12:03:42,893 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 12:03:42,894 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 12:03:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:42,896 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-23 12:03:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 12:03:42,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:42,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:42,896 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 12:03:42,897 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 12:03:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:42,899 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-23 12:03:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 12:03:42,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:42,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:42,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:42,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:03:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-11-23 12:03:42,903 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 99 [2018-11-23 12:03:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:42,903 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-11-23 12:03:42,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:03:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 12:03:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 12:03:42,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:42,904 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:42,905 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:42,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:42,905 INFO L82 PathProgramCache]: Analyzing trace with hash 35739294, now seen corresponding path program 10 times [2018-11-23 12:03:42,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:42,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:42,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:43,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 12:03:43,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7333#true} is VALID [2018-11-23 12:03:43,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 12:03:43,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #139#return; {7333#true} is VALID [2018-11-23 12:03:43,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret2 := main(); {7333#true} is VALID [2018-11-23 12:03:43,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7335#(= main_~i~0 0)} is VALID [2018-11-23 12:03:43,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {7335#(= 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; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:43,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#(<= 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; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:43,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(<= 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; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:43,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= 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; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:43,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {7339#(<= 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; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:43,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {7340#(<= 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; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:43,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {7341#(<= 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; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:43,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {7342#(<= 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; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:43,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {7343#(<= 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; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:43,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {7344#(<= 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; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:43,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {7345#(<= main_~i~0 10)} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,647 INFO L273 TraceCheckUtils]: 60: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,648 INFO L273 TraceCheckUtils]: 61: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,648 INFO L273 TraceCheckUtils]: 62: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,648 INFO L273 TraceCheckUtils]: 64: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,648 INFO L273 TraceCheckUtils]: 65: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,648 INFO L273 TraceCheckUtils]: 66: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 67: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 69: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 72: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 73: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 75: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 77: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 78: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 79: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 80: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 81: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,650 INFO L273 TraceCheckUtils]: 82: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,651 INFO L273 TraceCheckUtils]: 83: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,651 INFO L273 TraceCheckUtils]: 84: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,651 INFO L273 TraceCheckUtils]: 85: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,651 INFO L273 TraceCheckUtils]: 86: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,651 INFO L273 TraceCheckUtils]: 87: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,651 INFO L273 TraceCheckUtils]: 88: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,652 INFO L273 TraceCheckUtils]: 89: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,652 INFO L273 TraceCheckUtils]: 90: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,652 INFO L273 TraceCheckUtils]: 91: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,652 INFO L273 TraceCheckUtils]: 92: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,652 INFO L273 TraceCheckUtils]: 93: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,653 INFO L273 TraceCheckUtils]: 94: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,653 INFO L273 TraceCheckUtils]: 95: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,653 INFO L273 TraceCheckUtils]: 96: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,653 INFO L273 TraceCheckUtils]: 97: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,653 INFO L273 TraceCheckUtils]: 98: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,653 INFO L273 TraceCheckUtils]: 99: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,654 INFO L273 TraceCheckUtils]: 100: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,654 INFO L273 TraceCheckUtils]: 101: Hoare triple {7334#false} havoc ~x~0;~x~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,654 INFO L273 TraceCheckUtils]: 102: Hoare triple {7334#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7334#false} is VALID [2018-11-23 12:03:43,654 INFO L256 TraceCheckUtils]: 103: Hoare triple {7334#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {7334#false} is VALID [2018-11-23 12:03:43,654 INFO L273 TraceCheckUtils]: 104: Hoare triple {7334#false} ~cond := #in~cond; {7334#false} is VALID [2018-11-23 12:03:43,654 INFO L273 TraceCheckUtils]: 105: Hoare triple {7334#false} assume 0 == ~cond; {7334#false} is VALID [2018-11-23 12:03:43,655 INFO L273 TraceCheckUtils]: 106: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 12:03:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-23 12:03:43,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:43,661 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:43,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:43,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:43,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:43,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:43,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 12:03:43,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7333#true} is VALID [2018-11-23 12:03:43,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 12:03:43,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #139#return; {7333#true} is VALID [2018-11-23 12:03:43,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret2 := main(); {7333#true} is VALID [2018-11-23 12:03:43,986 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7364#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:43,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {7364#(<= 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; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:43,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#(<= 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; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:43,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(<= 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; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:43,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= 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; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:43,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {7339#(<= 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; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:43,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {7340#(<= 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; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:43,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {7341#(<= 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; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:43,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {7342#(<= 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; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:43,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {7343#(<= 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; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:43,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {7344#(<= 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; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:43,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {7345#(<= main_~i~0 10)} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,997 INFO L273 TraceCheckUtils]: 26: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,997 INFO L273 TraceCheckUtils]: 29: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 31: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 40: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 41: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 43: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 44: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:43,999 INFO L273 TraceCheckUtils]: 45: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 46: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 48: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 49: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 50: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 51: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:44,000 INFO L273 TraceCheckUtils]: 53: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 54: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 55: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 59: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,001 INFO L273 TraceCheckUtils]: 62: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 65: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 66: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 69: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,002 INFO L273 TraceCheckUtils]: 70: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 71: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 72: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 75: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 76: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 77: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:44,003 INFO L273 TraceCheckUtils]: 78: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 79: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 81: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 82: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 83: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 84: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 85: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,004 INFO L273 TraceCheckUtils]: 86: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 87: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 88: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 91: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 92: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 93: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,005 INFO L273 TraceCheckUtils]: 94: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 95: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 96: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 97: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 98: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 99: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 100: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 101: Hoare triple {7334#false} havoc ~x~0;~x~0 := 0; {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L273 TraceCheckUtils]: 102: Hoare triple {7334#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7334#false} is VALID [2018-11-23 12:03:44,006 INFO L256 TraceCheckUtils]: 103: Hoare triple {7334#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {7334#false} is VALID [2018-11-23 12:03:44,007 INFO L273 TraceCheckUtils]: 104: Hoare triple {7334#false} ~cond := #in~cond; {7334#false} is VALID [2018-11-23 12:03:44,007 INFO L273 TraceCheckUtils]: 105: Hoare triple {7334#false} assume 0 == ~cond; {7334#false} is VALID [2018-11-23 12:03:44,007 INFO L273 TraceCheckUtils]: 106: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 12:03:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-23 12:03:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:03:44,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-23 12:03:44,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:44,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:03:44,071 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:44,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:03:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:03:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:44,072 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 14 states. [2018-11-23 12:03:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:44,992 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2018-11-23 12:03:44,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:03:44,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-23 12:03:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2018-11-23 12:03:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2018-11-23 12:03:44,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 168 transitions. [2018-11-23 12:03:45,721 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:45,724 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:03:45,725 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 12:03:45,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 12:03:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-23 12:03:45,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:45,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2018-11-23 12:03:45,810 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 12:03:45,810 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 12:03:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:45,813 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 12:03:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 12:03:45,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:45,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:45,814 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 12:03:45,814 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 12:03:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:45,818 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 12:03:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 12:03:45,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:45,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:45,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:45,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:03:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-11-23 12:03:45,822 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 107 [2018-11-23 12:03:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:45,823 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-11-23 12:03:45,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:03:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 12:03:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:03:45,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:45,824 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:45,825 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:45,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1494923494, now seen corresponding path program 11 times [2018-11-23 12:03:45,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:45,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:45,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:46,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {8528#true} call ULTIMATE.init(); {8528#true} is VALID [2018-11-23 12:03:46,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {8528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8528#true} is VALID [2018-11-23 12:03:46,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {8528#true} assume true; {8528#true} is VALID [2018-11-23 12:03:46,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8528#true} {8528#true} #139#return; {8528#true} is VALID [2018-11-23 12:03:46,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {8528#true} call #t~ret2 := main(); {8528#true} is VALID [2018-11-23 12:03:46,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {8528#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8530#(= main_~i~0 0)} is VALID [2018-11-23 12:03:46,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {8530#(= 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; {8531#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:46,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {8531#(<= 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; {8532#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:46,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {8532#(<= 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; {8533#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:46,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {8533#(<= 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; {8534#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:46,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {8534#(<= 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; {8535#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:46,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {8535#(<= 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; {8536#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:46,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {8536#(<= 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; {8537#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:46,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {8537#(<= 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; {8538#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:46,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {8538#(<= 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; {8539#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:46,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {8539#(<= 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; {8540#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:46,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {8540#(<= 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; {8541#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:46,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {8541#(<= main_~i~0 11)} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,430 INFO L273 TraceCheckUtils]: 27: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 37: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 38: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,432 INFO L273 TraceCheckUtils]: 43: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 45: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 47: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 50: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,433 INFO L273 TraceCheckUtils]: 51: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 52: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 53: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 54: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 55: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 56: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 57: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 58: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,434 INFO L273 TraceCheckUtils]: 59: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 60: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 61: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 62: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 63: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 64: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 65: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 66: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,435 INFO L273 TraceCheckUtils]: 67: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 68: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 69: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 70: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 71: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 72: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 73: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 74: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,436 INFO L273 TraceCheckUtils]: 75: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 76: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 77: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 78: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 79: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 80: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 81: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 82: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,437 INFO L273 TraceCheckUtils]: 83: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 84: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 85: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 86: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 87: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 88: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 89: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 90: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 91: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,438 INFO L273 TraceCheckUtils]: 92: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 93: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 94: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 95: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 96: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 97: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 98: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 99: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,439 INFO L273 TraceCheckUtils]: 100: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 101: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 102: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 103: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 104: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 105: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 106: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 107: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:03:46,440 INFO L273 TraceCheckUtils]: 108: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:03:46,441 INFO L273 TraceCheckUtils]: 109: Hoare triple {8529#false} havoc ~x~0;~x~0 := 0; {8529#false} is VALID [2018-11-23 12:03:46,441 INFO L273 TraceCheckUtils]: 110: Hoare triple {8529#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8529#false} is VALID [2018-11-23 12:03:46,441 INFO L256 TraceCheckUtils]: 111: Hoare triple {8529#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {8529#false} is VALID [2018-11-23 12:03:46,441 INFO L273 TraceCheckUtils]: 112: Hoare triple {8529#false} ~cond := #in~cond; {8529#false} is VALID [2018-11-23 12:03:46,441 INFO L273 TraceCheckUtils]: 113: Hoare triple {8529#false} assume 0 == ~cond; {8529#false} is VALID [2018-11-23 12:03:46,441 INFO L273 TraceCheckUtils]: 114: Hoare triple {8529#false} assume !false; {8529#false} is VALID [2018-11-23 12:03:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-23 12:03:46,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:46,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 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:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:36,196 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:04:36,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:36,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:36,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {8528#true} call ULTIMATE.init(); {8528#true} is VALID [2018-11-23 12:04:36,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {8528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8528#true} is VALID [2018-11-23 12:04:36,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {8528#true} assume true; {8528#true} is VALID [2018-11-23 12:04:36,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8528#true} {8528#true} #139#return; {8528#true} is VALID [2018-11-23 12:04:36,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {8528#true} call #t~ret2 := main(); {8528#true} is VALID [2018-11-23 12:04:36,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {8528#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8528#true} is VALID [2018-11-23 12:04:36,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {8528#true} assume !(~i~0 < 100000); {8528#true} is VALID [2018-11-23 12:04:36,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {8528#true} ~i~0 := 0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 12:04:36,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {8528#true} assume !(~i~0 < 100000); {8528#true} is VALID [2018-11-23 12:04:36,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {8528#true} ~i~0 := 0; {8638#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:36,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {8638#(<= 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; {8531#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:36,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {8531#(<= 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; {8532#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:36,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {8532#(<= 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; {8533#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:36,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {8533#(<= 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; {8534#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:36,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {8534#(<= 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; {8535#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:36,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {8535#(<= 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; {8536#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:36,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {8536#(<= 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; {8537#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:36,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {8537#(<= 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; {8538#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:36,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {8538#(<= 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; {8539#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:36,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {8539#(<= 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; {8540#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:36,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {8540#(<= 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; {8541#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:36,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {8541#(<= main_~i~0 11)} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:04:36,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:04:36,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,421 INFO L273 TraceCheckUtils]: 48: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:04:36,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:04:36,423 INFO L273 TraceCheckUtils]: 58: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,423 INFO L273 TraceCheckUtils]: 59: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,423 INFO L273 TraceCheckUtils]: 60: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 66: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 67: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 68: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 69: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 72: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 73: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 75: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 76: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 77: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 78: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 79: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 82: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 83: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 84: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 85: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 86: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 87: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 88: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 89: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 90: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 91: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 92: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 93: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 94: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 95: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 96: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 98: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 99: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 100: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 101: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 102: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 103: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 104: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 105: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 106: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 107: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 108: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 109: Hoare triple {8529#false} havoc ~x~0;~x~0 := 0; {8529#false} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 110: Hoare triple {8529#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8529#false} is VALID [2018-11-23 12:04:36,430 INFO L256 TraceCheckUtils]: 111: Hoare triple {8529#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {8529#false} is VALID [2018-11-23 12:04:36,430 INFO L273 TraceCheckUtils]: 112: Hoare triple {8529#false} ~cond := #in~cond; {8529#false} is VALID [2018-11-23 12:04:36,430 INFO L273 TraceCheckUtils]: 113: Hoare triple {8529#false} assume 0 == ~cond; {8529#false} is VALID [2018-11-23 12:04:36,430 INFO L273 TraceCheckUtils]: 114: Hoare triple {8529#false} assume !false; {8529#false} is VALID [2018-11-23 12:04:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-23 12:04:36,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:36,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:04:36,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-23 12:04:36,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:36,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:04:36,533 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:04:36,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:04:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:04:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:04:36,534 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 15 states. [2018-11-23 12:04:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:38,178 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2018-11-23 12:04:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:04:38,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-23 12:04:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:04:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 176 transitions. [2018-11-23 12:04:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:04:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 176 transitions. [2018-11-23 12:04:38,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 176 transitions. [2018-11-23 12:04:38,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:38,822 INFO L225 Difference]: With dead ends: 230 [2018-11-23 12:04:38,822 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:04:38,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 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:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:04:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-23 12:04:38,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:38,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 128 states. [2018-11-23 12:04:38,922 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 12:04:38,922 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 12:04:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:38,925 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:04:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-23 12:04:38,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:38,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:38,926 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 12:04:38,926 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 12:04:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:38,929 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:04:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-23 12:04:38,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:38,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:38,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:38,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 12:04:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-11-23 12:04:38,933 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 115 [2018-11-23 12:04:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:38,934 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-11-23 12:04:38,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:04:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-23 12:04:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 12:04:38,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:38,936 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:04:38,936 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:38,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:38,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1418922270, now seen corresponding path program 12 times [2018-11-23 12:04:38,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:38,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:38,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:40,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {9810#true} call ULTIMATE.init(); {9810#true} is VALID [2018-11-23 12:04:40,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {9810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9810#true} is VALID [2018-11-23 12:04:40,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2018-11-23 12:04:40,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #139#return; {9810#true} is VALID [2018-11-23 12:04:40,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret2 := main(); {9810#true} is VALID [2018-11-23 12:04:40,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {9810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9812#(= main_~i~0 0)} is VALID [2018-11-23 12:04:40,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {9812#(= 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; {9813#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:40,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {9813#(<= 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; {9814#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:40,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {9814#(<= 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; {9815#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:40,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {9815#(<= 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; {9816#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:40,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {9816#(<= 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; {9817#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:40,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {9817#(<= 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; {9818#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:40,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {9818#(<= 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; {9819#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:40,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {9819#(<= 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; {9820#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:40,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {9820#(<= 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; {9821#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:40,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {9821#(<= 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; {9822#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:40,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {9822#(<= 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; {9823#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:40,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {9823#(<= 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; {9824#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:40,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {9824#(<= main_~i~0 12)} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 61: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,302 INFO L273 TraceCheckUtils]: 66: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 67: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 68: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 69: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 70: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 71: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 72: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 73: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,303 INFO L273 TraceCheckUtils]: 74: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 75: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 76: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 77: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 78: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 79: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 80: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 81: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 84: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 86: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 87: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 88: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 89: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 90: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,305 INFO L273 TraceCheckUtils]: 91: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 92: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 93: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 94: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 95: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 96: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 97: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 98: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,306 INFO L273 TraceCheckUtils]: 99: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 100: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 101: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 102: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 103: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 104: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 105: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 106: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 107: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,307 INFO L273 TraceCheckUtils]: 108: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 109: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 110: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 111: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 112: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 113: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 114: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 115: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:04:40,308 INFO L273 TraceCheckUtils]: 116: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:04:40,309 INFO L273 TraceCheckUtils]: 117: Hoare triple {9811#false} havoc ~x~0;~x~0 := 0; {9811#false} is VALID [2018-11-23 12:04:40,309 INFO L273 TraceCheckUtils]: 118: Hoare triple {9811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9811#false} is VALID [2018-11-23 12:04:40,309 INFO L256 TraceCheckUtils]: 119: Hoare triple {9811#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {9811#false} is VALID [2018-11-23 12:04:40,309 INFO L273 TraceCheckUtils]: 120: Hoare triple {9811#false} ~cond := #in~cond; {9811#false} is VALID [2018-11-23 12:04:40,309 INFO L273 TraceCheckUtils]: 121: Hoare triple {9811#false} assume 0 == ~cond; {9811#false} is VALID [2018-11-23 12:04:40,309 INFO L273 TraceCheckUtils]: 122: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2018-11-23 12:04:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 12:04:40,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:40,315 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:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:20,932 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:05:20,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:21,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {9810#true} call ULTIMATE.init(); {9810#true} is VALID [2018-11-23 12:05:21,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {9810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9810#true} is VALID [2018-11-23 12:05:21,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2018-11-23 12:05:21,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #139#return; {9810#true} is VALID [2018-11-23 12:05:21,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret2 := main(); {9810#true} is VALID [2018-11-23 12:05:21,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {9810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9810#true} is VALID [2018-11-23 12:05:21,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {9810#true} ~i~0 := 0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {9810#true} ~i~0 := 0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 35: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 36: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 37: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,163 INFO L273 TraceCheckUtils]: 38: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 39: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 41: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 42: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 43: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 45: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,164 INFO L273 TraceCheckUtils]: 46: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 47: Hoare triple {9810#true} ~i~0 := 0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 48: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 49: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 50: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 51: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 53: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 54: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,165 INFO L273 TraceCheckUtils]: 55: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,166 INFO L273 TraceCheckUtils]: 56: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,166 INFO L273 TraceCheckUtils]: 57: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,166 INFO L273 TraceCheckUtils]: 58: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 12:05:21,166 INFO L273 TraceCheckUtils]: 60: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 12:05:21,167 INFO L273 TraceCheckUtils]: 61: Hoare triple {9810#true} ~i~0 := 0; {10011#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:21,167 INFO L273 TraceCheckUtils]: 62: Hoare triple {10011#(<= 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; {9813#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:21,168 INFO L273 TraceCheckUtils]: 63: Hoare triple {9813#(<= 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; {9814#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:21,168 INFO L273 TraceCheckUtils]: 64: Hoare triple {9814#(<= 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; {9815#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:21,169 INFO L273 TraceCheckUtils]: 65: Hoare triple {9815#(<= 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; {9816#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:21,171 INFO L273 TraceCheckUtils]: 66: Hoare triple {9816#(<= 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; {9817#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:21,172 INFO L273 TraceCheckUtils]: 67: Hoare triple {9817#(<= 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; {9818#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:21,173 INFO L273 TraceCheckUtils]: 68: Hoare triple {9818#(<= 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; {9819#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:21,174 INFO L273 TraceCheckUtils]: 69: Hoare triple {9819#(<= 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; {9820#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:21,175 INFO L273 TraceCheckUtils]: 70: Hoare triple {9820#(<= 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; {9821#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:21,176 INFO L273 TraceCheckUtils]: 71: Hoare triple {9821#(<= 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; {9822#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:21,177 INFO L273 TraceCheckUtils]: 72: Hoare triple {9822#(<= 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; {9823#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:21,178 INFO L273 TraceCheckUtils]: 73: Hoare triple {9823#(<= 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; {9824#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:21,178 INFO L273 TraceCheckUtils]: 74: Hoare triple {9824#(<= main_~i~0 12)} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:05:21,179 INFO L273 TraceCheckUtils]: 75: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:05:21,179 INFO L273 TraceCheckUtils]: 76: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,179 INFO L273 TraceCheckUtils]: 77: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,179 INFO L273 TraceCheckUtils]: 78: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,179 INFO L273 TraceCheckUtils]: 79: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,180 INFO L273 TraceCheckUtils]: 80: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,180 INFO L273 TraceCheckUtils]: 82: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,180 INFO L273 TraceCheckUtils]: 83: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,180 INFO L273 TraceCheckUtils]: 84: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,181 INFO L273 TraceCheckUtils]: 85: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,181 INFO L273 TraceCheckUtils]: 86: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:05:21,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:05:21,182 INFO L273 TraceCheckUtils]: 90: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,182 INFO L273 TraceCheckUtils]: 92: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,183 INFO L273 TraceCheckUtils]: 94: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,183 INFO L273 TraceCheckUtils]: 95: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,183 INFO L273 TraceCheckUtils]: 96: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,183 INFO L273 TraceCheckUtils]: 98: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,184 INFO L273 TraceCheckUtils]: 99: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,184 INFO L273 TraceCheckUtils]: 100: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,184 INFO L273 TraceCheckUtils]: 101: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,184 INFO L273 TraceCheckUtils]: 102: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:05:21,184 INFO L273 TraceCheckUtils]: 103: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 12:05:21,185 INFO L273 TraceCheckUtils]: 104: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,185 INFO L273 TraceCheckUtils]: 105: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,185 INFO L273 TraceCheckUtils]: 106: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,185 INFO L273 TraceCheckUtils]: 107: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,185 INFO L273 TraceCheckUtils]: 108: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,185 INFO L273 TraceCheckUtils]: 109: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,186 INFO L273 TraceCheckUtils]: 110: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,186 INFO L273 TraceCheckUtils]: 111: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,186 INFO L273 TraceCheckUtils]: 112: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,186 INFO L273 TraceCheckUtils]: 113: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,186 INFO L273 TraceCheckUtils]: 114: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,186 INFO L273 TraceCheckUtils]: 115: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 12:05:21,187 INFO L273 TraceCheckUtils]: 116: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 12:05:21,187 INFO L273 TraceCheckUtils]: 117: Hoare triple {9811#false} havoc ~x~0;~x~0 := 0; {9811#false} is VALID [2018-11-23 12:05:21,187 INFO L273 TraceCheckUtils]: 118: Hoare triple {9811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9811#false} is VALID [2018-11-23 12:05:21,187 INFO L256 TraceCheckUtils]: 119: Hoare triple {9811#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {9811#false} is VALID [2018-11-23 12:05:21,187 INFO L273 TraceCheckUtils]: 120: Hoare triple {9811#false} ~cond := #in~cond; {9811#false} is VALID [2018-11-23 12:05:21,187 INFO L273 TraceCheckUtils]: 121: Hoare triple {9811#false} assume 0 == ~cond; {9811#false} is VALID [2018-11-23 12:05:21,188 INFO L273 TraceCheckUtils]: 122: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2018-11-23 12:05:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 12:05:21,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:21,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:21,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-11-23 12:05:21,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:21,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:21,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:21,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:21,304 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 16 states. [2018-11-23 12:05:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,470 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2018-11-23 12:05:22,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:22,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-11-23 12:05:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2018-11-23 12:05:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2018-11-23 12:05:22,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 184 transitions. [2018-11-23 12:05:23,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:23,247 INFO L225 Difference]: With dead ends: 245 [2018-11-23 12:05:23,247 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 12:05:23,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 12:05:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-23 12:05:23,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:23,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 136 states. [2018-11-23 12:05:23,394 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-23 12:05:23,394 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-23 12:05:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,398 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-11-23 12:05:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-23 12:05:23,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,399 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-23 12:05:23,399 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-23 12:05:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,405 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-11-23 12:05:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-23 12:05:23,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:23,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:05:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-11-23 12:05:23,410 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 123 [2018-11-23 12:05:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:23,410 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-11-23 12:05:23,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-23 12:05:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 12:05:23,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:23,412 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:05:23,412 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:23,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash -545231462, now seen corresponding path program 13 times [2018-11-23 12:05:23,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:23,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {11179#true} call ULTIMATE.init(); {11179#true} is VALID [2018-11-23 12:05:24,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {11179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11179#true} is VALID [2018-11-23 12:05:24,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {11179#true} assume true; {11179#true} is VALID [2018-11-23 12:05:24,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11179#true} {11179#true} #139#return; {11179#true} is VALID [2018-11-23 12:05:24,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {11179#true} call #t~ret2 := main(); {11179#true} is VALID [2018-11-23 12:05:24,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {11179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11181#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {11181#(= 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; {11182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {11182#(<= 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; {11183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {11183#(<= 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; {11184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {11184#(<= 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; {11185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {11185#(<= 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; {11186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {11186#(<= 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; {11187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {11187#(<= 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; {11188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {11188#(<= 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; {11189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {11189#(<= 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; {11190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {11190#(<= 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; {11191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {11191#(<= 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; {11192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {11192#(<= 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; {11193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {11193#(<= 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; {11194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {11194#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 39: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 42: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 45: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 56: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,317 INFO L273 TraceCheckUtils]: 57: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 58: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 59: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 62: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 63: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 64: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 65: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,318 INFO L273 TraceCheckUtils]: 66: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 68: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 70: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 72: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 73: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,319 INFO L273 TraceCheckUtils]: 74: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 78: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 79: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 80: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 81: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 82: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,320 INFO L273 TraceCheckUtils]: 83: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 84: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 85: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 89: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 90: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,321 INFO L273 TraceCheckUtils]: 91: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 92: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 93: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 94: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 95: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 96: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 97: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 98: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 99: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,322 INFO L273 TraceCheckUtils]: 100: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 101: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 102: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 103: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 104: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 105: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 106: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 107: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,323 INFO L273 TraceCheckUtils]: 108: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 109: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 110: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 111: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 112: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 113: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 114: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 115: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 116: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,324 INFO L273 TraceCheckUtils]: 117: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 118: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 119: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 120: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 121: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 122: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 123: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 124: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,325 INFO L273 TraceCheckUtils]: 125: Hoare triple {11180#false} havoc ~x~0;~x~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,326 INFO L273 TraceCheckUtils]: 126: Hoare triple {11180#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11180#false} is VALID [2018-11-23 12:05:24,326 INFO L256 TraceCheckUtils]: 127: Hoare triple {11180#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {11180#false} is VALID [2018-11-23 12:05:24,326 INFO L273 TraceCheckUtils]: 128: Hoare triple {11180#false} ~cond := #in~cond; {11180#false} is VALID [2018-11-23 12:05:24,326 INFO L273 TraceCheckUtils]: 129: Hoare triple {11180#false} assume 0 == ~cond; {11180#false} is VALID [2018-11-23 12:05:24,326 INFO L273 TraceCheckUtils]: 130: Hoare triple {11180#false} assume !false; {11180#false} is VALID [2018-11-23 12:05:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-11-23 12:05:24,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:24,333 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:24,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:24,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {11179#true} call ULTIMATE.init(); {11179#true} is VALID [2018-11-23 12:05:24,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {11179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11179#true} is VALID [2018-11-23 12:05:24,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {11179#true} assume true; {11179#true} is VALID [2018-11-23 12:05:24,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11179#true} {11179#true} #139#return; {11179#true} is VALID [2018-11-23 12:05:24,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {11179#true} call #t~ret2 := main(); {11179#true} is VALID [2018-11-23 12:05:24,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {11179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11213#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {11213#(<= 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; {11182#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {11182#(<= 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; {11183#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {11183#(<= 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; {11184#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {11184#(<= 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; {11185#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {11185#(<= 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; {11186#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {11186#(<= 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; {11187#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {11187#(<= 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; {11188#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {11188#(<= 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; {11189#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {11189#(<= 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; {11190#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {11190#(<= 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; {11191#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {11191#(<= 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; {11192#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {11192#(<= 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; {11193#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {11193#(<= 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; {11194#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {11194#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,775 INFO L273 TraceCheckUtils]: 37: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 43: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 46: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 49: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 50: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 51: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 52: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 57: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 60: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 63: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 64: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,778 INFO L273 TraceCheckUtils]: 65: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 66: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 67: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 68: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 71: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 72: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 73: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,779 INFO L273 TraceCheckUtils]: 74: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 75: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 76: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 77: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 78: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 79: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 80: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 81: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 83: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 84: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 86: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 87: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 88: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 89: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 90: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,781 INFO L273 TraceCheckUtils]: 91: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 92: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 93: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 94: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 95: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 96: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 97: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 98: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 99: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,782 INFO L273 TraceCheckUtils]: 100: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 101: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 102: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 103: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 104: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 106: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 107: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 108: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,783 INFO L273 TraceCheckUtils]: 109: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 110: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 111: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 112: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 113: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 114: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 115: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 116: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,784 INFO L273 TraceCheckUtils]: 117: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 118: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 119: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 120: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 121: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 122: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 123: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 124: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 125: Hoare triple {11180#false} havoc ~x~0;~x~0 := 0; {11180#false} is VALID [2018-11-23 12:05:24,785 INFO L273 TraceCheckUtils]: 126: Hoare triple {11180#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11180#false} is VALID [2018-11-23 12:05:24,786 INFO L256 TraceCheckUtils]: 127: Hoare triple {11180#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {11180#false} is VALID [2018-11-23 12:05:24,786 INFO L273 TraceCheckUtils]: 128: Hoare triple {11180#false} ~cond := #in~cond; {11180#false} is VALID [2018-11-23 12:05:24,786 INFO L273 TraceCheckUtils]: 129: Hoare triple {11180#false} assume 0 == ~cond; {11180#false} is VALID [2018-11-23 12:05:24,786 INFO L273 TraceCheckUtils]: 130: Hoare triple {11180#false} assume !false; {11180#false} is VALID [2018-11-23 12:05:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-11-23 12:05:24,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:24,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:24,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2018-11-23 12:05:24,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:24,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:24,882 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:05:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:24,884 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 17 states. [2018-11-23 12:05:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,944 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-11-23 12:05:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:25,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2018-11-23 12:05:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2018-11-23 12:05:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2018-11-23 12:05:25,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 192 transitions. [2018-11-23 12:05:26,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:26,947 INFO L225 Difference]: With dead ends: 260 [2018-11-23 12:05:26,947 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 12:05:26,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 12:05:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-23 12:05:27,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:27,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 144 states. [2018-11-23 12:05:27,084 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 144 states. [2018-11-23 12:05:27,084 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 144 states. [2018-11-23 12:05:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,087 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-11-23 12:05:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 12:05:27,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:27,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:27,088 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 144 states. [2018-11-23 12:05:27,088 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 144 states. [2018-11-23 12:05:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,090 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-11-23 12:05:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 12:05:27,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:27,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:27,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:27,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 12:05:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-23 12:05:27,094 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 131 [2018-11-23 12:05:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:27,094 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-23 12:05:27,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 12:05:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:05:27,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:27,096 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:05:27,096 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:27,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2020285342, now seen corresponding path program 14 times [2018-11-23 12:05:27,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:27,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:27,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {12635#true} call ULTIMATE.init(); {12635#true} is VALID [2018-11-23 12:05:27,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {12635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12635#true} is VALID [2018-11-23 12:05:27,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {12635#true} assume true; {12635#true} is VALID [2018-11-23 12:05:27,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12635#true} {12635#true} #139#return; {12635#true} is VALID [2018-11-23 12:05:27,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {12635#true} call #t~ret2 := main(); {12635#true} is VALID [2018-11-23 12:05:27,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {12635#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12637#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {12637#(= 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; {12638#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {12638#(<= 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; {12639#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {12639#(<= 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; {12640#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {12640#(<= 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; {12641#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {12641#(<= 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; {12642#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {12642#(<= 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; {12643#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {12643#(<= 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; {12644#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {12644#(<= 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; {12645#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:27,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {12645#(<= 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; {12646#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:27,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {12646#(<= 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; {12647#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:27,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {12647#(<= 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; {12648#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:27,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {12648#(<= 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; {12649#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:27,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {12649#(<= 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; {12650#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:27,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {12650#(<= 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; {12651#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:27,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {12651#(<= main_~i~0 14)} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,714 INFO L273 TraceCheckUtils]: 29: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 46: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,717 INFO L273 TraceCheckUtils]: 50: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,719 INFO L273 TraceCheckUtils]: 68: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 70: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 92: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 93: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,722 INFO L273 TraceCheckUtils]: 94: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 101: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 102: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,723 INFO L273 TraceCheckUtils]: 103: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 104: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 105: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 106: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 107: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 108: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 109: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 110: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,724 INFO L273 TraceCheckUtils]: 111: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 112: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 115: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 116: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 117: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 118: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 119: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,725 INFO L273 TraceCheckUtils]: 120: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 121: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 122: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 123: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 124: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 125: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 126: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 127: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 128: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,726 INFO L273 TraceCheckUtils]: 129: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 130: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 131: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 132: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 133: Hoare triple {12636#false} havoc ~x~0;~x~0 := 0; {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 134: Hoare triple {12636#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L256 TraceCheckUtils]: 135: Hoare triple {12636#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 136: Hoare triple {12636#false} ~cond := #in~cond; {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 137: Hoare triple {12636#false} assume 0 == ~cond; {12636#false} is VALID [2018-11-23 12:05:27,727 INFO L273 TraceCheckUtils]: 138: Hoare triple {12636#false} assume !false; {12636#false} is VALID [2018-11-23 12:05:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-23 12:05:27,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:27,735 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:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:27,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:27,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:28,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {12635#true} call ULTIMATE.init(); {12635#true} is VALID [2018-11-23 12:05:28,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {12635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12635#true} is VALID [2018-11-23 12:05:28,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {12635#true} assume true; {12635#true} is VALID [2018-11-23 12:05:28,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12635#true} {12635#true} #139#return; {12635#true} is VALID [2018-11-23 12:05:28,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {12635#true} call #t~ret2 := main(); {12635#true} is VALID [2018-11-23 12:05:28,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {12635#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12670#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {12670#(<= 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; {12638#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {12638#(<= 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; {12639#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {12639#(<= 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; {12640#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {12640#(<= 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; {12641#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {12641#(<= 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; {12642#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {12642#(<= 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; {12643#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {12643#(<= 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; {12644#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:28,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {12644#(<= 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; {12645#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:28,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {12645#(<= 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; {12646#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:28,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {12646#(<= 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; {12647#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:28,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {12647#(<= 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; {12648#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:28,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {12648#(<= 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; {12649#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:28,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {12649#(<= 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; {12650#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:28,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {12650#(<= 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; {12651#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:28,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {12651#(<= main_~i~0 14)} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,122 INFO L273 TraceCheckUtils]: 25: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 46: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,126 INFO L273 TraceCheckUtils]: 48: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 49: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 51: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 53: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 58: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 67: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 70: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 71: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 72: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 73: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,129 INFO L273 TraceCheckUtils]: 74: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 75: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 76: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 77: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 78: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 80: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 81: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 82: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,130 INFO L273 TraceCheckUtils]: 83: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 84: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 85: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 86: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 87: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 88: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 89: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 90: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 91: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,131 INFO L273 TraceCheckUtils]: 92: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 93: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 94: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 95: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 96: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 97: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 98: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 99: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 100: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,132 INFO L273 TraceCheckUtils]: 101: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 102: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 103: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 104: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 105: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 106: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 107: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 108: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 109: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,133 INFO L273 TraceCheckUtils]: 110: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 111: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 112: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 113: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 114: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 115: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 116: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 117: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,134 INFO L273 TraceCheckUtils]: 118: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 119: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 120: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 121: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 122: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 123: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 124: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 125: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 126: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,135 INFO L273 TraceCheckUtils]: 127: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 128: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 129: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 130: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 131: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 132: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 133: Hoare triple {12636#false} havoc ~x~0;~x~0 := 0; {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 134: Hoare triple {12636#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L256 TraceCheckUtils]: 135: Hoare triple {12636#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {12636#false} is VALID [2018-11-23 12:05:28,136 INFO L273 TraceCheckUtils]: 136: Hoare triple {12636#false} ~cond := #in~cond; {12636#false} is VALID [2018-11-23 12:05:28,137 INFO L273 TraceCheckUtils]: 137: Hoare triple {12636#false} assume 0 == ~cond; {12636#false} is VALID [2018-11-23 12:05:28,137 INFO L273 TraceCheckUtils]: 138: Hoare triple {12636#false} assume !false; {12636#false} is VALID [2018-11-23 12:05:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-23 12:05:28,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:28,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:28,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-23 12:05:28,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:28,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:28,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:28,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:28,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:28,208 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 18 states. [2018-11-23 12:05:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:30,779 INFO L93 Difference]: Finished difference Result 275 states and 298 transitions. [2018-11-23 12:05:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:30,779 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-23 12:05:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2018-11-23 12:05:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2018-11-23 12:05:30,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 200 transitions. [2018-11-23 12:05:30,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:30,999 INFO L225 Difference]: With dead ends: 275 [2018-11-23 12:05:31,000 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 12:05:31,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 12:05:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-23 12:05:31,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:31,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 152 states. [2018-11-23 12:05:31,085 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 152 states. [2018-11-23 12:05:31,086 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 152 states. [2018-11-23 12:05:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,088 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:05:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-11-23 12:05:31,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,088 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 152 states. [2018-11-23 12:05:31,088 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 152 states. [2018-11-23 12:05:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,091 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:05:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-11-23 12:05:31,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:31,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 12:05:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2018-11-23 12:05:31,095 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 139 [2018-11-23 12:05:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:31,095 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2018-11-23 12:05:31,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-11-23 12:05:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 12:05:31,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:31,097 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:05:31,097 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:31,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1618430950, now seen corresponding path program 15 times [2018-11-23 12:05:31,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {14178#true} call ULTIMATE.init(); {14178#true} is VALID [2018-11-23 12:05:31,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {14178#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14178#true} is VALID [2018-11-23 12:05:31,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {14178#true} assume true; {14178#true} is VALID [2018-11-23 12:05:31,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14178#true} {14178#true} #139#return; {14178#true} is VALID [2018-11-23 12:05:31,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {14178#true} call #t~ret2 := main(); {14178#true} is VALID [2018-11-23 12:05:31,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {14178#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14180#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {14180#(= 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; {14181#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {14181#(<= 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; {14182#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {14182#(<= 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; {14183#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {14183#(<= 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; {14184#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {14184#(<= 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; {14185#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {14185#(<= 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; {14186#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {14186#(<= 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; {14187#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {14187#(<= 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; {14188#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {14188#(<= 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; {14189#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {14189#(<= 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; {14190#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {14190#(<= 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; {14191#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:31,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {14191#(<= 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; {14192#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:31,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {14192#(<= 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; {14193#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:31,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {14193#(<= 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; {14194#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:31,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {14194#(<= 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; {14195#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:31,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {14195#(<= main_~i~0 15)} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,781 INFO L273 TraceCheckUtils]: 28: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,782 INFO L273 TraceCheckUtils]: 32: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,783 INFO L273 TraceCheckUtils]: 42: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 44: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 45: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 46: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 50: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,784 INFO L273 TraceCheckUtils]: 52: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 54: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 55: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 56: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 57: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 58: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 59: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 60: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,785 INFO L273 TraceCheckUtils]: 61: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 62: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 63: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 64: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 65: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 66: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 67: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 68: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,786 INFO L273 TraceCheckUtils]: 69: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 72: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 73: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,787 INFO L273 TraceCheckUtils]: 78: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 79: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 81: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 83: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 89: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 90: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 91: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 93: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 97: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 98: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 100: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 101: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,790 INFO L273 TraceCheckUtils]: 105: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 106: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 107: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 108: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 109: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 110: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 115: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 116: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 117: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 118: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 119: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 123: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 124: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 127: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 128: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 129: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 130: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,793 INFO L273 TraceCheckUtils]: 131: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 132: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 133: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 135: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 136: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 137: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 138: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 139: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 12:05:31,794 INFO L273 TraceCheckUtils]: 140: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 12:05:31,795 INFO L273 TraceCheckUtils]: 141: Hoare triple {14179#false} havoc ~x~0;~x~0 := 0; {14179#false} is VALID [2018-11-23 12:05:31,795 INFO L273 TraceCheckUtils]: 142: Hoare triple {14179#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14179#false} is VALID [2018-11-23 12:05:31,795 INFO L256 TraceCheckUtils]: 143: Hoare triple {14179#false} call __VERIFIER_assert((if 49 == #t~mem1 then 1 else 0)); {14179#false} is VALID [2018-11-23 12:05:31,795 INFO L273 TraceCheckUtils]: 144: Hoare triple {14179#false} ~cond := #in~cond; {14179#false} is VALID [2018-11-23 12:05:31,795 INFO L273 TraceCheckUtils]: 145: Hoare triple {14179#false} assume 0 == ~cond; {14179#false} is VALID [2018-11-23 12:05:31,795 INFO L273 TraceCheckUtils]: 146: Hoare triple {14179#false} assume !false; {14179#false} is VALID [2018-11-23 12:05:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-23 12:05:31,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:31,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2